Affine motion model restrictions for memory bandwidth reduction of enhanced interpolation filter

ABSTRACT

A method for coding a video implemented in an encoder or a decoder including the enhanced interpolation filter, EIF, for motion compensation, the method comprising: i) determining control point motion vectors, CPMVs, for a block according to affine inter-prediction, the block being an affine block or a sub-block of the affine block; ii) for a predefined sub-block size determining a reference area for a sub-block with the predefined sub-block size according to values of the CPMVs; iii) comparing the determined reference area with a predefined threshold; iv) applying EIF for motion compensation, comprising deriving the pixel-based motion vector field for the block; wherein if the determined reference area is larger than the threshold, deriving the pixel-based motion vector field for the block further comprises motion vector clipping, wherein motion vector clipping range is determined based on motion model of the block and the size of the block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No. PCT/RU2020/050258, filed on Sep. 30, 2020, which claims priority to International Patent Application No. PCT/RU2019/000691, filed on Sep. 30, 2019 and priority of U.S. provisional Application No. 62/958,291, filed on Jan. 7, 2020. All of the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

Embodiments of the present disclosure generally relate to the field of picture processing and more particularly to inter prediction.

BACKGROUND

Video coding (video encoding and decoding) is used in a wide range of digital video applications, for example broadcast digital TV, video transmission over internet and mobile networks, real-time conversational applications such as video chat, video conferencing, DVD and Blu-ray discs, video content acquisition and editing systems, and camcorders of security applications.

The amount of video data needed to depict even a relatively short video can be substantial, which may result in difficulties when the data is to be streamed or otherwise communicated across a communications network with limited bandwidth capacity. Thus, video data is generally compressed before being communicated across modern day telecommunications networks. The size of a video could also be an issue when the video is stored on a storage device because memory resources may be limited. Video compression devices often use software and/or hardware at the source to code the video data prior to transmission or storage, thereby decreasing the quantity of data needed to represent digital video images. The compressed data is then received at the destination by a video decompression device that decodes the video data. With limited network resources and ever-increasing demands of higher video quality, improved compression and decompression techniques that improve compression ratio with little to no sacrifice in picture quality are desirable.

SUMMARY

Embodiments of the present disclosure provide apparatuses and methods for encoding and decoding according to the independent claims.

The foregoing and other objects are achieved by the subject matter of the independent claims.

Further implementation forms are apparent from the dependent claims, the description and the figures.

The present disclosure provides:

A method for coding a video implemented in an encoder or a decoder including the enhanced interpolation filter, EIF, for motion compensation, the method comprising:

-   -   i) determining control point motion vectors, CPMVs, for a block         according to affine inter-prediction, the block being an affine         block or a sub-block of the affine block;     -   ii) for a predefined sub-block size determining a reference area         for a sub-block with the predefined sub-block size according to         values of the CPMVs;     -   iii) comparing the determined reference area with a predefined         threshold;     -   iv) applying EIF for motion compensation, comprising deriving         the pixel-based motion vector field for the block;     -   wherein if the determined reference area is larger than the         threshold, deriving the pixel-based motion vector field for the         block further comprises motion vector clipping,     -   wherein motion vector clipping range is determined based on         motion model of the block and the size of the block.

Here, it should be understood that a reference area for a sub-block should mean the minimal rectangular area in the reference frame that contains all samples that are needed to perform motion compensation of the sub-block according to the derived motion vector field and interpolation filter length.

It should be noted that in the context of the present disclosure the term line should have the same meaning as the term row.

In order to improve coding efficiency of inter prediction, block based affine transform prediction may be applied. Here, filtering using Enhanced bi-linear Interpolation Filter (EIF) can be used for a whole prediction block and on sub-block basis. EIF may be applied to simplify motion compensation as bilinear interpolation filter is used instead of 8/4-tap DCT-based interpolation filters. In addition for video content with specific motion characteristics, e.g. when the rotation is the dominant motion, EIF provides video coding performance improvement due to pixel-based motion vector field is used.

Thus, in the method described above, EIF, it is determined whether the use of EIF in the present context may be restricted. In case the use of EIF may be restricted in the present context, motion vector clipping may be performed and then EIF may be applied using the clipped motion vectors. Thereby, EIF may be used even for situations in which otherwise restrictions might impede the use of EIF.

In comparison with using MV clipping in EIF without any additional conditions, the current method of prior reference area determination guaranteed that clipping is used only when memory consumption is more than maximum allowed. This method provides benefit for 6-parameters affine motion model where asymmetric vertical and horizontal scaling can occurs. For example if block is scaled with scaling factor X vertically and scaled with scaling factor 1/X horizontally the reference area of the block is almost the same as the area of the block, so motion vector clipping made for restricting memory bandwidth is not needed in this case. Not applying additional motion vector clipping in cases when memory bandwidth is less than the threshold provides video coding efficiency improvement as additional motion vector clipping cause motion field quality degradation that in turn cause predicted and reconstructed signal quality degradation.

In the method, as described above, using EIF for motion compensation may further comprise:

-   -   obtaining interpolated samples in a reference picture based on         the derived motion vector field using a T taps interpolation         filter, where T is the number of interpolation filter taps         corresponding to the filter length, where T is larger than one;         and     -   applying a high-pass filter to the interpolated samples

In the method, as described above using EIF for motion compensation may further comprise:

-   -   determining a size of the block; and     -   comparing the size of the block with a first threshold for the         size of the block;     -   wherein block-based affine transform prediction is performed on         the block when the size of the block is greater than or equal to         the first threshold for the size of the block.

It should further be understood that “block-based” in that context should mean motion compensation, MC, where the same motion vector, MV, is used for the whole sub-block in contrast to EIF, where MC is pixel-based.

In the method, as described above the size of the block may be determined based on affine motion model parameters.

In the method, as described above the affine motion model parameters may include motion vector differences of the CPMVs as well as a width and a height of the block.

In the method, as described above the affine motion model parameters may further include a precision of the CPMVs.

In the method, as described above the predefined threshold may be calculated based on the predefined sub-block size and a predefined ratio of the reference area corresponding to the sub-block in the reference picture to the area of the sub-block.

In the method, as described above the predefined ratio of the reference area corresponding to the sub-block in the reference picture to the area of the sub-block may correspond to a memory bandwidth for the EIF.

In the method, as described above the predefined threshold may be the maximum allowed memory access consumption for the predefined sub-block size of the block.

Thus, in other words, the predefined threshold may be determined based on the maximum allowed memory access consumption per one sample and the predefined sub-block size.

In the method, as described above determining the reference area for a sub-block with the predefined sub-block size according to values of the CPMVs may comprise:

-   -   determining an expanded block by adding pixel margins to from         each border of the sub-block based on a length of the high-pass         filter;     -   deriving motion vectors for each corner of the expanded block         based on the CPMVs;     -   deriving a transformed block in the reference picture based on         the derived motion vectors; and     -   deriving a bounding box for the transformed block;     -   wherein the area of the reference block corresponds to the         bounding box expanded by (T-1) pixel from each border of the         bounding box.

In the method, as described above, the size of the bounding box for the transformed block in the reference picture may be derived by using the following equation, where the max function returns the maximum value of the arguments, and the min function returns the minimum value of the arguments:

$\begin{matrix} \left\{ {\begin{matrix} {W^{\prime} = {{\max\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)} - {\min\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)} + 1}} \\ {H^{\prime} = {{\max\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} - {\min\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} + 1}} \end{matrix}\quad} \right. & \left( {2\text{-}5} \right) \end{matrix}$

where the location of the transformed block in reference picture is describe by the coordinates of the corner samples of the transformed expanded block (top-left, top-right, bottom-left, bottom-right):

$\left\{ {\begin{matrix} {\left( {X_{0}^{\prime},Y_{0}^{\prime}} \right) = \left( {0,0} \right)} \\ {\left( {X_{1}^{\prime},Y_{1}^{\prime}} \right) = \left( {{1 + W + {\left( {W + 1} \right){dHorX}}},{\left( {W + 1} \right){dHorY}}} \right)} \\ {\left( {X_{2}^{\prime},Y_{2}^{\prime}} \right) = \left( {{\left( {H + 1} \right){dVerX}},{1 + H + {\left( {H + 1} \right){dVerY}}}} \right)} \\ {\left( {X_{3}^{\prime},Y_{3}^{\prime}} \right) = \left( {{1 + W + {\left( {W + 1} \right){dHorX}} + {\left( {H + 1} \right){dVerX}}},{1 +}} \right.} \\ \left. {H + {\left( {W + 1} \right){dHorY}} + {\left( {H + 1} \right){dVerY}}} \right) \end{matrix}\quad} \right.$

where W and H are the sub-block width and heights respectively, and dHorX, dHorY, dVerX, dVerY are the horizontal and vertical gradient parameters of the affine motion model.

Here, it should be understood that, cf. FIG. 6, the affine motion field of a block may be described by motion information of two control point (4-parameter) or three control point motion vectors (CPMV) (6-parameter). Thus, the general equations for calculation motion vector at sample location (x, y) are presented here. These are:

$\left\{ {\begin{matrix} {{mv}_{x} = {{{dHorX}*x} + {{dVerX}*y} + {mv}_{0x}}} \\ {{mv}_{y} = {{{dHorY}*x} + {{dVerY}*y} + {mv}_{0y}}} \end{matrix}\quad} \right.$

For the 4-parameter affine motion model, the motion vector at sample location (x, y) may be derived as:

$\left\{ {\begin{matrix} {{mv}_{x} = {{\frac{{mv}_{1x} - {mv}_{0x}}{W}x} + {\frac{{mv}_{0y} - {mv}_{1y}}{W}y} + {mv}_{0x}}} \\ {{mv}_{y} = {{\frac{{mv}_{1y} - {mv}_{0y}}{W}x} + {\frac{{mv}_{1x} - {mv}_{0x}}{W}y} + {mv}_{0y}}} \end{matrix}\quad} \right.$

For the 6-parameter affine motion model, the motion vector at sample location (x, y) may be derived as:

$\left\{ {\begin{matrix} {{mv}_{x} = {{\frac{{mv}_{1x} - {mv}_{0x}}{W}x} + {\frac{{mv}_{2x} - {mv}_{0x}}{H}y} + {mv}_{0x}}} \\ {{mv}_{y} = {{\frac{{mv}_{1y} - {mv}_{0y}}{W}x} + {\frac{{mv}_{2y} - {mv}_{0y}}{H}y} + {mv}_{0y}}} \end{matrix}\quad} \right.$

where (mv_(0x), mv_(0y)) is motion vector of the top-left corner control point, (mv_(1x), mv_(1y)) is motion vector of the top-right corner control point, and (mv_(2x), mv_(2y)) is motion vector of the bottom-left corner control point; where W is the width of the block and H is the height of the block.

For the case of using the 6-parameter affine motion model

${{dHorX} = \frac{{mv}_{1x} - {mv}_{0x}}{W}},{{dHorY} = \frac{{mv}_{1y} - {mv}_{0y}}{W}},{{dVerX} = \frac{{mv}_{2x} - {mv}_{0x}}{H}},{{dVerY} = \frac{{mv}_{2y} - {mv}_{0y}}{H}}$

For the case of using the 4-parameter affine motion model,

${{dHorX} = \frac{{mv}_{1x} - {mv}_{0x}}{W}},{{dHorY} = \frac{{mv}_{1y} - {mv}_{0y}}{W}},{{dVerX} = {- {dHorY}}},{{dVerY} = {{dHorX}.}}$

As for translational motion inter prediction, there are also two affine, motion inter prediction modes: affine merge mode and affine AMVP mode.

In the method, as described above

-   -   the size of the bounding may be given by W′×H′; or     -   the size of the bounding box may be given by Ceil(W′)×Ceil(H′);         or     -   the size of the bound box may be given by Floor(W′)×Floor(H′).

In the method, as described above the method may further comprise:

-   -   determining the memory access consumption of the sub-block based         on the size of the bounding box of the transformed sub-block and         the filter length;     -   determining a maximum allowed memory access consumption for the         sub-block based on the size of the sub-block and the filter         length; and     -   upon fulfilling a constraint that the determined memory access         consumption is not larger than the maximum allowed memory access         consumption EIF for motion compensation for the block is to be         performed. In this case MV clipping is used to guarantee that         the MVs are not pointed outside the picture.

In the method, as described above the value of the filter length may be predefined for both encoder and decoder, or may be specified in a parameter set of a codec video sequence.

In the method, as described above for a 4×4 sub-block, the predefined threshold T may be given by

$T = \frac{\left( {4 + T^{\prime} - 1} \right)*\left( {4 + T^{\prime} - 1} \right)}{4*4}$

where T′ is the length of motion compensation MC interpolation filter for a translational motion block.

In the method, as described above, for an 8×8 sub-block, the predefined threshold T may be given by

$T = \frac{\left( {8 + T^{\prime} - 1} \right)*\left( {8 + T^{\prime} - 1} \right)}{8*8}$

where T′ is the length of motion compensation MC interpolation filter for a translational motion block.

The method, as described above may further comprise:

-   -   calculating a motion vector for the center of the block and         performing translational motion compensation.

The method, as described above may further comprise: the predefined size of the sub-block for the enhanced interpolation filter is equal to 4×4; wherein dX[0] corresponds to dHorX, dX[1] corresponds to dHorY, dY[0] corresponds to dVerX and dY[1] corresponds to dVerY; wherein determining reference area for a sub-block with predefined sub-block size according to values of the CPMVs may further comprise:

-   -   setting the value of the variable eifSubblockSize equal to 4;     -   deriving the arrays X[i], Y[i] as follows:         -   X[0]=0;         -   X[1]=(eifSubblockSize+1)*(dX[0]+(1<<9));         -   X[2]=(eifSubblockSize+1)*dY[0];         -   X[3]=X[1]+X[2];         -   Y[0]=0;         -   Y[1]=(eifSubblockSize+1)*dX[1];         -   Y[2]=(eifSubblockSize+1)*(dY[1]+(1<<9));         -   Y[3]=Y[1]+Y[2];     -   setting the value of the variable Xmax equal to maximum of X[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Xmin equal to minimum of X[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Ymax equal to maximum of Y[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Ymin equal to minimum of Y[i]         for i being equal to 0 . . . 3     -   setting the value of the variable W equal to the value of         (Xmax−Xmin+(1<<9)−1)>>9     -   setting the value of the variable H equal to the value of         (Ymax−Ymin+(1<<9)−1)>>9.

The precision of dX[0], dX[1], dY[0], dY[1] may be given by 1/2^(K), i.e. K bits, where K is an integer number greater than 0. Thus, for example, for K being equal to 9, i.e. 9 bits, the variables dX[0], dX[1], dY[0], dY[1] are in given 1/512 precision.

For the example above, the motion vectors precision is 9 bit and (1<<9) corresponds to one integer sample. In case of precision of dX[0], dX[1], dY[0], dY[1] is equal to K and (1<<K) corresponds to one integer sample the equations above can be formulated as following:

-   -   setting the value of the variable eifSubblockSize equal to 4;     -   deriving the arrays X[i], Y[i] as follows:         -   X[0]=0;         -   X[1]=(eifSubblockSize+1)*(dX[0]+(1<<K));         -   X[2]=(eifSubblockSize+1)*dY[0];         -   X[3]=X[1]+X[2];         -   Y[0]=0;         -   Y[1]=(eifSubblockSize+1)*dX[1]         -   Y[2]=(eifSubblockSize+1)*(dY[1]+(1<<K));         -   Y[3]=Y[1]+Y[2];     -   setting the value of the variable Xmax equal to maximum of X[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Xmin equal to minimum of X[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Ymax equal to maximum of Y[i]         for i being equal to 0 . . . 3     -   setting the value of the variable Ymin equal to minimum of Y[i]         for i being equal to 0 . . . 3     -   setting the value of the variable W equal to the value of         (Xmax−Xmin+(1<<K)−1)>>K     -   setting the value of the variable H equal to the value of         (Ymax−Ymin+(1<<K)−1)>>K.

In the method, as described above, may further comprise: in case the affine inter-prediction comprises bi-prediction, the constraint symmetrically applied for both lists.

Here, it should be understood that the condition is applied symmetrically: memory consumption should be less than the threshold for both L0 and L1 reference lists, e.g. it could be different affine motion models for L0 and L1. Thus, it should be understood that the decision about using motion vector clipping with clipping range derived based on affine motion models parameters may be made once for the L0 and L1 reference lists (directions). In other words, the motion compensation scheme for L0 and L1 should be always the same.

In the method, as described above T may be equal to 2, in this case bilinear interpolation is used to obtain predicted samples from the reference frame.

In the method, as described above the predefined threshold may be equal to 72.

Here, it should be understood that a number of filter taps is the same for list 0 and list1, but motion models could be different for list0 and list1. In particular, CPMVs in case of affine motion model could be different for list0 and list1.

In the method, as described above the motion model may be the affine motion model and a motion vector clipping range may be determined based on motion model parameters determined based on CPMVs.

In the method, as described above the method may further comprise:

-   -   determining the memory access consumption of the sub-block based         on the size of the bounding box of the transformed sub-block and         the filter length;     -   determining a maximum allowed memory access consumption for the         sub-block based on the size of the sub-block and the filter         length; and     -   upon fulfilling a constraint that the determined memory access         consumption is not larger than the maximum allowed memory access         consumption EIF for motion compensation for the block is to be         performed. In this case, MV clipping is used to guarantee that         the MVs are not pointed outside the picture.

The present disclosure further provides an encoder comprising processing circuitry for carrying out the method as described above.

The present disclosure further provides a decoder comprising processing circuitry for carrying out the method as described above.

The present disclosure further provides a computer program product comprising program code for performing the method as described above when executed on a computer or a processor.

The present disclosure further provides a decoder, comprising:

-   -   one or more processors; and     -   a non-transitory computer-readable storage medium coupled to the         one or more processors and storing instructions for execution by         the one or more processors, wherein the instructions, when         executed by the one or more processors, configure the decoder to         carry out the method as described above.

The present disclosure further provides an encoder, comprising:

-   -   one or more processors; and     -   a non-transitory computer-readable storage medium coupled to the         one or more processors and storing instructions for execution by         the one or more processors, wherein the instructions, when         executed by the one or more processors, configure the encoder to         carry out the method as described above.

The present disclosure further discloses a non-transitory computer-readable medium carrying a program code which, when executed by a computer device, causes the computer device to perform the method as described above.

The present disclosure further discloses a decoder or an encoder for coding a video sequence, including the enhanced interpolation filter, EIF, for motion compensation, the decoder or encoder comprising, respectively:

-   -   a first determining unit configured to determine control point         motion vectors, CPMVs, for a block according to affine         inter-prediction, the block being an affine block or a sub-block         of the affine block;     -   a second determining unit configured to determine for a         predefined sub-block size a reference area for a sub-block with         the predefined sub-block size according to values of the CPMVs;         -   a comparing unit configured to compare the determined             reference area with a predefined threshold;         -   a motion compensation unit configured to apply EIF for             motion compensation, comprising deriving the pixel-based             motion vector field for the block;     -   wherein if the determined reference area is larger than the         threshold, the motion compensation unit is configured to derive         the pixel-based motion vector field for the block further         comprises motion vector clipping,     -   wherein motion vector clipping range is determined based on         motion model of the block and the size of the block.

Details of one or more embodiments are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description, drawings, and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following embodiments are described in more detail with reference to the attached figures and drawings, in which:

FIG. 1A is a block diagram showing an example of a video coding system configured to implement embodiments of the disclosure;

FIG. 1B is a block diagram showing another example of a video coding system configured to implement embodiments of the disclosure;

FIG. 2 is a block diagram showing an example of a video encoder configured to implement embodiments of the disclosure;

FIG. 3 is a block diagram showing an example structure of a video decoder configured to implement embodiments of the disclosure;

FIG. 4 is a block diagram illustrating an example of an encoding apparatus or a decoding apparatus;

FIG. 5 is a block diagram illustrating another example of an encoding apparatus or a decoding apparatus;

FIG. 6 is an illustration example of control point based affine motion model: 4-parameters and 6-parameters;

FIG. 7 is an illustration example of affine sub-block motion vector field;

FIG. 8 is an illustration example of the coordinates of corners of affine block (sub-block) and of intermediate, expanded EIF block (sub-block);

FIG. 9 is an illustration example of the location of transformed block (sub-block) in reference picture and corresponding bounding box;

FIG. 10 is a block diagram showing an example structure of a content supply system 3100 that realizes a content delivery service;

FIG. 11 is a block diagram showing a structure of an example of a terminal device;

FIG. 12 illustrates a method for coding a video implemented by a coding device, i.e. an encoder or a decoder, according to the present disclosure;

FIG. 13 illustrates a decoder for decoding a video sequence according to an embodiment of the present disclosure;

FIG. 14 illustrates an encoder for encoding a video sequence according to an embodiment of the present disclosure.

In the following identical reference signs refer to identical or at least functionally equivalent features if not explicitly specified otherwise.

DETAILED DESCRIPTION OF THE EMBODIMENTS

In the following description, reference is made to the accompanying figures, which form part of the disclosure, and which show, by way of illustration, specific aspects of embodiments of the disclosure or specific aspects in which embodiments of the present disclosure may be used. It is understood that embodiments of the disclosure may be used in other aspects and comprise structural or logical changes not depicted in the figures. The following detailed description, therefore, is not to be taken in a limiting sense, and the scope of the present application is defined by the appended claims.

For instance, it is understood that a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa. For example, if one or a plurality of specific method steps are described, a corresponding device may include one or a plurality of units, e.g. functional units, to perform the described one or plurality of method steps (e.g. one unit performing the one or plurality of steps, or a plurality of units each performing one or more of the plurality of steps), even if such one or more units are not explicitly described or illustrated in the figures. On the other hand, for example, if a specific apparatus is described based on one or a plurality of units, e.g. functional units, a corresponding method may include one step to perform the functionality of the one or plurality of units (e.g. one step performing the functionality of the one or plurality of units, or a plurality of steps each performing the functionality of one or more of the plurality of units), even if such one or plurality of steps are not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary embodiments and/or aspects described herein may be combined with each other, unless specifically noted otherwise.

Video coding typically refers to the processing of a sequence of pictures, which form the video or video sequence. Instead of the term “picture” the term “frame” or “image” may be used as synonyms in the field of video coding. Video coding (or coding in general) comprises two parts video encoding and video decoding. Video encoding is performed at the source side, typically comprising processing (e.g. by compression) the original video pictures to reduce the amount of data required for representing the video pictures (for more efficient storage and/or transmission). Video decoding is performed at the destination side and typically comprises the inverse processing compared to the encoder to reconstruct the video pictures. Embodiments referring to “coding” of video pictures (or pictures in general) shall be understood to relate to “encoding” or “decoding” of video pictures or respective video sequences. The combination of the encoding part and the decoding part is also referred to as CODEC (Coding and Decoding).

In case of lossless video coding, the original video pictures can be reconstructed, i.e. the reconstructed video pictures have the same quality as the original video pictures (assuming no transmission loss or other data loss during storage or transmission). In case of lossy video coding, further compression, e.g. by quantization, is performed, to reduce the amount of data representing the video pictures, which cannot be completely reconstructed at the decoder, i.e. the quality of the reconstructed video pictures is lower or worse compared to the quality of the original video pictures.

Several video coding standards belong to the group of “lossy hybrid video codecs” (i.e. combine spatial and temporal prediction in the sample domain and 2D transform coding for applying quantization in the transform domain). Each picture of a video sequence is typically partitioned into a set of non-overlapping blocks and the coding is typically performed on a block level. In other words, at the encoder the video is typically processed, i.e. encoded, on a block (video block) level, e.g. by using spatial (intra picture) prediction and/or temporal (inter picture) prediction to generate a prediction block, subtracting the prediction block from the current block (block currently processed/to be processed) to obtain a residual block, transforming the residual block and quantizing the residual block in the transform domain to reduce the amount of data to be transmitted (compression), whereas at the decoder the inverse processing compared to the encoder is applied to the encoded or compressed block to reconstruct the current block for representation. Furthermore, the encoder duplicates the decoder processing loop such that both will generate identical predictions (e.g. intra- and inter predictions) and/or re-constructions for processing, i.e. coding, the subsequent blocks.

In the following embodiments of a video coding system 10, a video encoder 20 and a video decoder 30 are described based on FIGS. 1 to 3.

FIG. 1A is a schematic block diagram illustrating an example coding system 10, e.g. a video coding system 10 (or short coding system 10) that may utilize techniques of this present disclosure. Video encoder 20 (or short encoder 20) and video decoder 30 (or short decoder 30) of video coding system 10 represent examples of devices that may be configured to perform techniques in accordance with various examples described in the present disclosure.

As shown in FIG. 1A, the coding system 10 comprises a source device 12 configured to provide encoded picture data 21 e.g. to a destination device 14 for decoding the encoded picture data 13.

The source device 12 comprises an encoder 20, and may additionally, i.e. optionally, comprise a picture source 16, a pre-processor (or pre-processing unit) 18, e.g. a picture pre-processor 18, and a communication interface or communication unit 22.

The picture source 16 may comprise or be any kind of picture capturing device, for example a camera for capturing a real-world picture, and/or any kind of a picture generating device, for example a computer-graphics processor for generating a computer animated picture, or any kind of other device for obtaining and/or providing a real-world picture, a computer generated picture (e.g. a screen content, a virtual reality (VR) picture) and/or any combination thereof (e.g. an augmented reality (AR) picture). The picture source may be any kind of memory or storage storing any of the aforementioned pictures.

In distinction to the pre-processor 18 and the processing performed by the pre-processing unit 18, the picture or picture data 17 may also be referred to as raw picture or raw picture data 17.

Pre-processor 18 is configured to receive the (raw) picture data 17 and to perform pre-processing on the picture data 17 to obtain a pre-processed picture 19 or pre-processed picture data 19. Pre-processing performed by the pre-processor 18 may, e.g., comprise trimming, color format conversion (e.g. from RGB to YCbCr), color correction, or de-noising. It can be understood that the pre-processing unit 18 may be optional component.

The video encoder 20 is configured to receive the pre-processed picture data 19 and provide encoded picture data 21 (further details will be described below, e.g., based on FIG. 2).

Communication interface 22 of the source device 12 may be configured to receive the encoded picture data 21 and to transmit the encoded picture data 21 (or any further processed version thereof) over communication channel 13 to another device, e.g. the destination device 14 or any other device, for storage or direct reconstruction.

The destination device 14 comprises a decoder 30 (e.g. a video decoder 30), and may additionally, i.e. optionally, comprise a communication interface or communication unit 28, a post-processor 32 (or post-processing unit 32) and a display device 34.

The communication interface 28 of the destination device 14 is configured receive the encoded picture data 21 (or any further processed version thereof), e.g. directly from the source device 12 or from any other source, e.g. a storage device, e.g. an encoded picture data storage device, and provide the encoded picture data 21 to the decoder 30.

The communication interface 22 and the communication interface 28 may be configured to transmit or receive the encoded picture data 21 or encoded data 13 via a direct communication link between the source device 12 and the destination device 14, e.g. a direct wired or wireless connection, or via any kind of network, e.g. a wired or wireless network or any combination thereof, or any kind of private and public network, or any kind of combination thereof.

The communication interface 22 may be, e.g., configured to package the encoded picture data 21 into an appropriate format, e.g. packets, and/or process the encoded picture data using any kind of transmission encoding or processing for transmission over a communication link or communication network.

The communication interface 28, forming the counterpart of the communication interface 22, may be, e.g., configured to receive the transmitted data and process the transmission data using any kind of corresponding transmission decoding or processing and/or de-packaging to obtain the encoded picture data 21.

Both, communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces as indicated by the arrow for the communication channel 13 in FIG. 1A pointing from the source device 12 to the destination device 14, or bi-directional communication interfaces, and may be configured, e.g. to send and receive messages, e.g. to set up a connection, to acknowledge and exchange any other information related to the communication link and/or data transmission, e.g. encoded picture data transmission.

The decoder 30 is configured to receive the encoded picture data 21 and provide decoded picture data 31 or a decoded picture 31 (further details will be described below, e.g., based on FIG. 3 or FIG. 5).

The post-processor 32 of destination device 14 is configured to post-process the decoded picture data 31 (also called reconstructed picture data), e.g. the decoded picture 31, to obtain post-processed picture data 33, e.g. a post-processed picture 33. The post-processing performed by the post-processing unit 32 may comprise, e.g. color format conversion (e.g. from YCbCr to RGB), color correction, trimming, or re-sampling, or any other processing, e.g. for preparing the decoded picture data 31 for display, e.g. by display device 34.

The display device 34 of the destination device 14 is configured to receive the post-processed picture data 33 for displaying the picture, e.g. to a user or viewer. The display device 34 may be or comprise any kind of display for representing the reconstructed picture, e.g. an integrated or external display or monitor. The displays may, e.g. comprise liquid crystal displays (LCD), organic light emitting diodes (OLED) displays, plasma displays, projectors, micro LED displays, liquid crystal on silicon (LCoS), digital light processor (DLP) or any kind of other display.

Although FIG. 1A depicts the source device 12 and the destination device 14 as separate devices, embodiments of devices may also comprise both or both functionalities, the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality. In such embodiments the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality may be implemented using the same hardware and/or software or by separate hardware and/or software or any combination thereof.

As will be apparent for the skilled person based on the description, the existence and (exact) split of functionalities of the different units or functionalities within the source device 12 and/or destination device 14 as shown in FIG. 1A may vary depending on the actual device and application.

The encoder 20 (e.g. a video encoder 20) or the decoder 30 (e.g. a video decoder 30) or both encoder 20 and decoder 30 may be implemented via processing circuitry as shown in FIG. 1B, such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, hardware, video coding dedicated or any combinations thereof. The encoder 20 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to encoder 20 of FIG. 2 and/or any other encoder system or subsystem described herein. The decoder 30 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to decoder 30 of FIG. 3 and/or any other decoder system or subsystem described herein. The processing circuitry may be configured to perform the various operations as discussed later. As shown in FIG. 5, if the techniques are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer-readable storage medium and may execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Either of video encoder 20 and video decoder 30 may be integrated as part of a combined encoder/decoder (CODEC) in a single device, for example, as shown in FIG. 1B.

Source device 12 and destination device 14 may comprise any of a wide range of devices, including any kind of handheld or stationary devices, e.g. notebook or laptop computers, mobile phones, smart phones, tablets or tablet computers, cameras, desktop computers, set-top boxes, televisions, display devices, digital media players, video gaming consoles, video streaming devices (such as content services servers or content delivery servers), broadcast receiver device, broadcast transmitter device, or the like and may use no or any kind of operating system. In some cases, the source device 12 and the destination device 14 may be equipped for wireless communication. Thus, the source device 12 and the destination device 14 may be wireless communication devices.

In some cases, video coding system 10 illustrated in FIG. 1A is merely an example and the techniques of the present disclosure may apply to video coding settings (e.g., video encoding or video decoding) that do not necessarily include any data communication between the encoding and decoding devices. In other examples, data is retrieved from a local memory, streamed over a network, or the like. A video encoding device may encode and store data to memory, and/or a video decoding device may retrieve and decode data from memory. In some examples, the encoding and decoding is performed by devices that do not communicate with one another, but simply encode data to memory and/or retrieve and decode data from memory.

For convenience of description, embodiments are described herein, for example, by reference to High-Efficiency Video Coding (HEVC) or to the reference software of Versatile Video coding (VVC), the next generation video coding standard developed by the Joint Collaboration Team on Video Coding (JCT-VC) of ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Motion Picture Experts Group (MPEG). One of ordinary skill in the art will understand that embodiments are not limited to HEVC or VVC.

Encoder and Encoding Method

FIG. 2 shows a schematic block diagram of an example video encoder 20 that is configured to implement the techniques of the present disclosure. In the example of FIG. 2, the video encoder 20 comprises an input 201 (or input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, and inverse transform processing unit 212, a reconstruction unit 214, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy encoding unit 270 and an output 272 (or output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254 and a partitioning unit 262. Inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). A video encoder 20 as shown in FIG. 2 may also be referred to as hybrid video encoder or a video encoder according to a hybrid video codec.

The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the mode selection unit 260 may be referred to as forming a forward signal path of the encoder 20, whereas the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20, wherein the backward signal path of the video encoder 20 corresponds to the signal path of the decoder (see video decoder 30 in FIG. 3). The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 are also referred to forming the “built-in decoder” of video encoder 20.

Pictures & Picture Partitioning (Pictures & Blocks)

The encoder 20 may be configured to receive, e.g. via input 201, a picture 17 (or picture data 17), e.g. picture of a sequence of pictures forming a video or video sequence. The received picture or picture data may also be a pre-processed picture 19 (or pre-processed picture data 19). For sake of simplicity, the following description refers to the picture 17. The picture 17 may also be referred to as current picture or picture to be coded (in particular in video coding to distinguish the current picture from other pictures, e.g. previously encoded and/or decoded pictures of the same video sequence, i.e. the video sequence which also comprises the current picture).

A (digital) picture is or can be regarded as a two-dimensional array or matrix of samples with intensity values. A sample in the array may also be referred to as pixel (short form of picture element) or a pel. The number of samples in horizontal and vertical direction (or axis) of the array or picture define the size and/or resolution of the picture. For representation of color, typically three color components are employed, i.e. the picture may be represented or include three sample arrays. In RBG format or color space a picture comprises a corresponding red, green and blue sample array. However, in video coding each pixel is typically represented in a luminance and chrominance format or color space, e.g. YCbCr, which comprises a luminance component indicated by Y (sometimes also L is used instead) and two chrominance components indicated by Cb and Cr. The luminance (or short luma) component Y represents the brightness or grey level intensity (e.g. like in a grey-scale picture), while the two chrominance (or short chroma) components Cb and Cr represent the chromaticity or color information components. Accordingly, a picture in YCbCr format comprises a luminance sample array of luminance sample values (Y), and two chrominance sample arrays of chrominance values (Cb and Cr). Pictures in RGB format may be converted or transformed into YCbCr format and vice versa, the process is also known as color transformation or conversion. If a picture is monochrome, the picture may comprise only a luminance sample array. Accordingly, a picture may be, for example, an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 colour format.

Embodiments of the video encoder 20 may comprise a picture partitioning unit (not depicted in FIG. 2) configured to partition the picture 17 into a plurality of (typically non-overlapping) picture blocks 203. These blocks may also be referred to as root blocks, macro blocks (H.264/AVC) or coding tree blocks (CTB) or coding tree units (CTU) (H.265/HEVC and VVC). The picture partitioning unit may be configured to use the same block size for all pictures of a video sequence and the corresponding grid defining the block size, or to change the block size between pictures or subsets or groups of pictures, and partition each picture into the corresponding blocks.

In further embodiments, the video encoder may be configured to receive directly a block 203 of the picture 17, e.g. one, several or all blocks forming the picture 17. The picture block 203 may also be referred to as current picture block or picture block to be coded.

Like the picture 17, the picture block 203 again is or can be regarded as a two-dimensional array or matrix of samples with intensity values (sample values), although of smaller dimension than the picture 17. In other words, the block 203 may comprise, e.g., one sample array (e.g. a luma array in case of a monochrome picture 17, or a luma or chroma array in case of a color picture) or three sample arrays (e.g. a luma and two chroma arrays in case of a color picture 17) or any other number and/or kind of arrays depending on the color format applied. The number of samples in horizontal and vertical direction (or axis) of the block 203 define the size of block 203. Accordingly, a block may, for example, an MxN (M-column by N-row) array of samples, or an M×N array of transform coefficients.

Embodiments of the video encoder 20 as shown in FIG. 2 may be configured to encode the picture 17 block by block, e.g. the encoding and prediction is performed per block 203.

Embodiments of the video encoder 20 as shown in FIG. 2 may be further configured to partition and/or encode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or encoded using one or more slices (typically non-overlapping), and each slice may comprise one or more blocks (e.g. CTUs) or one or more groups of blocks (e.g. tiles (H.265/HEVC and VVC) or bricks (VVC)).

Embodiments of the video encoder 20 as shown in FIG. 2 may be further configured to partition and/or encode the picture by using slices/tile groups (also referred to as video tile groups) and/or tiles (also referred to as video tiles), wherein a picture may be partitioned into or encoded using one or more slices/tile groups (typically non-overlapping), and each slice/tile group may comprise, e.g. one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile, e.g. may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks.

Residual Calculation

The residual calculation unit 204 may be configured to calculate a residual block 205 (also referred to as residual 205) based on the picture block 203 and a prediction block 265 (further details about the prediction block 265 are provided later), e.g. by subtracting sample values of the prediction block 265 from sample values of the picture block 203, sample by sample (pixel by pixel) to obtain the residual block 205 in the sample domain.

Transform

The transform processing unit 206 may be configured to apply a transform, e.g. a discrete cosine transform (DCT) or discrete sine transform (DST), on the sample values of the residual block 205 to obtain transform coefficients 207 in a transform domain. The transform coefficients 207 may also be referred to as transform residual coefficients and represent the residual block 205 in the transform domain.

The transform processing unit 206 may be configured to apply integer approximations of DCT/DST, such as the transforms specified for H.265/HEVC. Compared to an orthogonal DCT transform, such integer approximations are typically scaled by a certain factor. In order to preserve the norm of the residual block which is processed by forward and inverse transforms, additional scaling factors are applied as part of the transform process. The scaling factors are typically chosen based on certain constraints like scaling factors being a power of two for shift operations, bit depth of the transform coefficients, tradeoff between accuracy and implementation costs, etc. Specific scaling factors are, for example, specified for the inverse transform, e.g. by inverse transform processing unit 212 (and the corresponding inverse transform, e.g. by inverse transform processing unit 312 at video decoder 30) and corresponding scaling factors for the forward transform, e.g. by transform processing unit 206, at an encoder 20 may be specified accordingly.

Embodiments of the video encoder 20 (respectively transform processing unit 206) may be configured to output transform parameters, e.g. a type of transform or transforms, e.g. directly or encoded or compressed via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and use the transform parameters for decoding.

Quantization

The quantization unit 208 may be configured to quantize the transform coefficients 207 to obtain quantized coefficients 209, e.g. by applying scalar quantization or vector quantization.

The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209.

The quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be rounded down to an m-bit Transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a quantization parameter (QP). For example, for scalar quantization, different scaling may be applied to achieve finer or coarser quantization. Smaller quantization step sizes correspond to finer quantization, whereas larger quantization step sizes correspond to coarser quantization. The applicable quantization step size may be indicated by a quantization parameter (QP). The quantization parameter may for example be an index to a predefined set of applicable quantization step sizes. For example, small quantization parameters may correspond to fine quantization (small quantization step sizes) and large quantization parameters may correspond to coarse quantization (large quantization step sizes) or vice versa. The quantization may include division by a quantization step size and a corresponding and/or the inverse dequantization, e.g. by inverse quantization unit 210, may include multiplication by the quantization step size. Embodiments according to some standards, e.g. HEVC, may be configured to use a quantization parameter to determine the quantization step size. Generally, the quantization step size may be calculated based on a quantization parameter using a fixed-point approximation of an equation including division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which might get modified because of the scaling used in the fixed-point approximation of the equation for quantization step size and quantization parameter. In one example implementation, the scaling of the inverse transform and dequantization might be combined. Alternatively, customized quantization tables may be used and signaled from an encoder to a decoder, e.g. in a bitstream. The quantization is a lossy operation, wherein the loss increases with increasing quantization step sizes.

Embodiments of the video encoder 20 (respectively quantization unit 208) may be configured to output quantization parameters (QP), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and apply the quantization parameters for decoding.

Inverse Quantization

The inverse quantization unit 210 is configured to apply the inverse quantization of the quantization unit 208 on the quantized coefficients to obtain dequantized coefficients 211, e.g. by applying the inverse of the quantization scheme applied by the quantization unit 208 based on or using the same quantization step size as the quantization unit 208. The dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211 and correspond—although typically not identical to the transform coefficients due to the loss by quantization—to the transform coefficients 207.

Inverse Transform

The inverse transform processing unit 212 is configured to apply the inverse transform of the transform applied by the transform processing unit 206, e.g. an inverse discrete cosine transform (DCT) or inverse discrete sine transform (DST) or other inverse transforms, to obtain a reconstructed residual block 213 (or corresponding dequantized coefficients 213) in the sample domain. The reconstructed residual block 213 may also be referred to as transform block 213.

Reconstruction

The reconstruction unit 214 (e.g. adder or summer 214) is configured to add the transform block 213 (i.e. reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in the sample domain, e.g. by adding—sample by sample—the sample values of the reconstructed residual block 213 and the sample values of the prediction block 265.

Filtering

The loop filter unit 220 (or short “loop filter” 220), is configured to filter the reconstructed block 215 to obtain a filtered block 221, or in general, to filter reconstructed samples to obtain filtered sample values. The loop filter unit is, e.g., configured to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 220 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, e.g. an adaptive loop filter (ALF), a noise suppression filter (NSF), or any combination thereof. In an example, the loop filter unit 220 may comprise a de-blocking filter, a SAO filter and an ALF filter. The order of the filtering process may be the deblocking filter, SAO and ALF. In another example, a process called the luma mapping with chroma scaling (LMCS) (namely, the adaptive in-loop reshaper) is added. This process is performed before deblocking. In another example, the deblocking filter process may be also applied to internal sub-block edges, e.g. affine sub-blocks edges, ATMVP sub-blocks edges, sub-block transform (SBT) edges and intra sub-partition (ISP) edges. Although the loop filter unit 220 is shown in FIG. 2 as being an in-loop filter, in other configurations, the loop filter unit 220 may be implemented as a post loop filter. The filtered block 221 may also be referred to as filtered reconstructed block 221.

Embodiments of the video encoder 20 (respectively loop filter unit 220) may be configured to output loop filter parameters (such as SAO filter parameters or ALF filter parameters or LMCS parameters), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., a decoder 30 may receive and apply the same loop filter parameters or respective loop filters for decoding.

Decoded Picture Buffer

The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or in general reference picture data, for encoding video data by video encoder 20. The DPB 230 may be formed by any of a variety of memory devices, such as dynamic random-access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may be further configured to store other previously filtered blocks, e.g. previously reconstructed and filtered blocks 221, of the same current picture or of different pictures, e.g. previously reconstructed pictures, and may provide complete previously reconstructed, i.e. decoded, pictures (and corresponding reference blocks and samples) and/or a partially reconstructed current picture (and corresponding reference blocks and samples), for example for inter prediction. The decoded picture buffer (DPB) 230 may be also configured to store one or more unfiltered reconstructed blocks 215, or in general unfiltered reconstructed samples, e.g. if the reconstructed block 215 is not filtered by loop filter unit 220, or any other further processed version of the reconstructed blocks or samples.

Mode Selection (Partitioning & Prediction)

The mode selection unit 260 comprises partitioning unit 262, inter-prediction unit 244 and intra-prediction unit 254, and is configured to receive or obtain original picture data, e.g. an original block 203 (current block 203 of the current picture 17), and reconstructed picture data, e.g. filtered and/or unfiltered reconstructed samples or blocks of the same (current) picture and/or from one or a plurality of previously decoded pictures, e.g. from decoded picture buffer 230 or other buffers (e.g. line buffer, not shown). The reconstructed picture data is used as reference picture data for prediction, e.g. inter-prediction or intra-prediction, to obtain a prediction block 265 or predictor 265.

Mode selection unit 260 may be configured to determine or select a partitioning for a current block prediction mode (including no partitioning) and a prediction mode (e.g. an intra or inter prediction mode) and generate a corresponding prediction block 265, which is used for the calculation of the residual block 205 and for the reconstruction of the reconstructed block 215.

Embodiments of the mode selection unit 260 may be configured to select the partitioning and the prediction mode (e.g. from those supported by or available for mode selection unit 260), which provide the best match or in other words the minimum residual (minimum residual means better compression for transmission or storage), or a minimum signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which considers or balances both. The mode selection unit 260 may be configured to determine the partitioning and prediction mode based on rate distortion optimization (RDO), i.e. select the prediction mode, which provides a minimum rate distortion. Terms like “best”, “minimum”, “optimum” etc. in this context do not necessarily refer to an overall “best”, “minimum”, “optimum”, etc. but may also refer to the fulfillment of a termination or selection criterion like a value exceeding or falling below a threshold or other constraints leading potentially to a “sub-optimum selection” but reducing complexity and processing time.

In other words, the partitioning unit 262 may be configured to partition a picture from a video sequence into a sequence of coding tree units (CTUs), and the CTU 203 may be further partitioned into smaller block partitions or sub-blocks (which form again blocks), e.g. iteratively using quad-tree-partitioning (QT), binary partitioning (BT) or triple-tree-partitioning (TT) or any combination thereof, and to perform, e.g., the prediction for each of the block partitions or sub-blocks, wherein the mode selection comprises the selection of the tree-structure of the partitioned block 203 and the prediction modes are applied to each of the block partitions or sub-blocks.

In the following the partitioning (e.g. by partitioning unit 260) and prediction processing (by inter-prediction unit 244 and intra-prediction unit 254) performed by an example video encoder 20 will be explained in more detail.

Partitioning

The partitioning unit 262 may be configured to partition a picture from a video sequence into a sequence of coding tree units (CTUs), and the partitioning unit 262 may partition (or split) a coding tree unit (CTU) 203 into smaller partitions, e.g. smaller blocks of square or rectangular size. For a picture that has three sample arrays, a CTU consists of an N×N block of luma samples together with two corresponding blocks of chroma samples. The maximum allowed size of the luma block in a CTU is specified to be 128×128 in the developing versatile video coding (VVC), but it can be specified to be value rather than 128×128 in the future, for example, 256×256. The CTUs of a picture may be clustered/grouped as slices/tile groups, tiles or bricks. A tile covers a rectangular region of a picture, and a tile can be divided into one or more bricks. A brick consists of a number of CTU rows within a tile. A tile that is not partitioned into multiple bricks can be referred to as a brick. However, a brick is a true subset of a tile and is not referred to as a tile. There are two modes of tile groups are supported in VVC, namely the raster-scan slice/tile group mode and the rectangular slice mode. In the raster-scan tile group mode, a slice/tile group contains a sequence of tiles in tile raster scan of a picture. In the rectangular slice mode, a slice contains a number of bricks of a picture that collectively form a rectangular region of the picture. The bricks within a rectangular slice are in the order of brick raster scan of the slice. These smaller blocks (which may also be referred to as sub-blocks) may be further partitioned into even smaller partitions.

This is also referred to tree-partitioning or hierarchical tree-partitioning, wherein a root block, e.g. at root tree-level 0 (hierarchy-level 0, depth 0), may be recursively partitioned, e.g. partitioned into two or more blocks of a next lower tree-level, e.g. nodes at tree-level 1 (hierarchy-level 1, depth 1), wherein these blocks may be again partitioned into two or more blocks of a next lower level, e.g. tree-level 2 (hierarchy-level 2, depth 2), etc. until the partitioning is terminated, e.g. because a termination criterion is fulfilled, e.g. a maximum tree depth or minimum block size is reached. Blocks, which are not further partitioned, are also referred to as leaf-blocks or leaf nodes of the tree. A tree using partitioning into two partitions is referred to as binary-tree (BT), a tree using partitioning into three partitions is referred to as ternary-tree (TT), and a tree using partitioning into four partitions is referred to as quad-tree (QT).

For example, a coding tree unit (CTU) may be or comprise a CTB of luma samples, two corresponding CTBs of chroma samples of a picture that has three sample arrays, or a CTB of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly, a coding tree block (CTB) may be an N×N block of samples for some value of N such that the division of a component into CTBs is a partitioning. A coding unit (CU) may be or comprise a coding block of luma samples, two corresponding coding blocks of chroma samples of a picture that has three sample arrays, or a coding block of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly, a coding block (CB) may be an M×N block of samples for some values of M and N such that the division of a CTB into coding blocks is a partitioning.

In embodiments, e.g., according to HEVC, a coding tree unit (CTU) may be split into CUs by using a quad-tree structure denoted as coding tree. The decision whether to code a picture area using inter-picture (temporal) or intra-picture (spatial) prediction is made at the leaf CU level. Each leaf CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a leaf CU can be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU.

In embodiments, e.g., according to the latest video coding standard currently in development, which is referred to as Versatile Video Coding (VVC), a combined Quad-tree nested multi-type tree using binary and ternary splits segmentation structure for example used to partition a coding tree unit. In the coding tree structure within a coding tree unit, a CU can have either a square or a rectangular shape. For example, the coding tree unit (CTU) is first partitioned by a quaternary tree. Then the quaternary tree leaf nodes can be further partitioned by a multi-type tree structure. There are four splitting types in multi-type tree structure, vertical binary splitting (SPLIT_BT_VER), horizontal binary splitting (SPLIT_BT_HOR), vertical ternary splitting (SPLIT_TT_VER), and horizontal ternary splitting (SPLIT_TT_HOR). The multi-type tree leaf nodes are called coding units (CUs), and unless the CU is too large for the maximum transform length, this segmentation is used for prediction and transform processing without any further partitioning. This means that, in most cases, the CU, PU and TU have the same block size in the quadtree with nested multi-type tree coding block structure. The exception occurs when maximum supported transform length is smaller than the width or height of the colour component of the CU.VVC develops a unique signaling mechanism of the partition splitting information in quadtree with nested multi-type tree coding tree structure. In the signalling mechanism, a coding tree unit (CTU) is treated as the root of a quaternary tree and is first partitioned by a quaternary tree structure. Each quaternary tree leaf node (when sufficiently large to allow it) is then further partitioned by a multi-type tree structure. In the multi-type tree structure, a first flag (mtt_split_cu_flag) is signalled to indicate whether the node is further partitioned; when a node is further partitioned, a second flag (mtt_split_cu_vertical_flag) is signalled to indicate the splitting direction, and then a third flag (mtt_split_cu_binary_flag) is signalled to indicate whether the split is a binary split or a ternary split. Based on the values of mtt_split_cu_vertical_flag and mtt_split_cu_binary_flag, the multi-type tree slitting mode (MttSplitMode) of a CU can be derived by a decoder based on a predefined rule or a table. It should be noted, for a certain design, for example, 64×64 Luma block and 32×32 Chroma pipelining design in VVC hardware decoders, TT split is forbidden when either width or height of a luma coding block is larger than 64, as shown in FIG. 6. TT split is also forbidden when either width or height of a chroma coding block is larger than 32. The pipelining design will divide a picture into Virtual pipeline data units (VPDUs) which are defined as non-overlapping units in a picture. In hardware decoders, successive VPDUs are processed by multiple pipeline stages simultaneously. The VPDU size is roughly proportional to the buffer size in most pipeline stages, so it is important to keep the VPDU size small. In most hardware decoders, the VPDU size can be set to maximum transform block (TB) size. However, in VVC, ternary tree (TT) and binary tree (BT) partition may lead to the increasing of VPDUs sizes

In addition, it should be noted that, when a portion of a tree node block exceeds the bottom or right picture boundary, the tree node block is forced to be split until the all samples of every coded CU are located inside the picture boundaries.

As an example, the Intra Sub-Partitions (ISP) tool may divide luma intra-predicted blocks vertically or horizontally into 2 or 4 sub-partitions depending on the block size.

In one example, the mode selection unit 260 of video encoder 20 may be configured to perform any combination of the partitioning techniques described herein.

As described above, the video encoder 20 is configured to determine or select the best or an optimum prediction mode from a set of (e.g. pre-determined) prediction modes. The set of prediction modes may comprise, e.g., intra-prediction modes and/or inter-prediction modes.

Intra-Prediction

The set of intra-prediction modes may comprise 35 different intra-prediction modes, e.g. non-directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined in HEVC, or may comprise 67 different intra-prediction modes, e.g. non-directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined for VVC. As an example, several conventional angular intra prediction modes are adaptively replaced with wide-angle intra prediction modes for the non-square blocks, e.g. as defined in VVC. As another example, to avoid division operations for DC prediction, only the longer side is used to compute the average for non-square blocks. Moreover, the results of intra prediction of planar mode may be further modified by a position dependent intra prediction combination (PDPC) method.

The intra-prediction unit 254 is configured to use reconstructed samples of neighboring blocks of the same current picture to generate an intra-prediction block 265 according to an intra-prediction mode of the set of intra-prediction modes.

The intra prediction unit 254 (or in general the mode selection unit 260) is further configured to output intra-prediction parameters (or in general information indicative of the selected intra prediction mode for the block) to the entropy encoding unit 270 in form of syntax elements 266 for inclusion into the encoded picture data 21, so that, e.g., the video decoder 30 may receive and use the prediction parameters for decoding.

Inter-Prediction

The set of (or possible) inter-prediction modes depends on the available reference pictures (i.e. previous at least partially decoded pictures, e.g. stored in DBP 230) and other inter-prediction parameters, e.g. whether the whole reference picture or only a part, e.g. a search window area around the area of the current block, of the reference picture is used for searching for a best matching reference block, and/or e.g. whether pixel interpolation is applied, e.g. half/semi-pel, quarter-pel and/or 1/16 pel interpolation, or not.

Additional to the above prediction modes, skip mode, direct mode and/or other inter prediction mode may be applied.

For example, Extended merge prediction, the merge candidate list of such mode is constructed by including the following five types of candidates in order: Spatial MVP from spatial neighbor CUs, Temporal MVP from collocated CUs, History-based MVP from a FIFO table, Pairwise average MVP and Zero MVs. Moreover, a bilateral-matching based decoder side motion vector refinement (DMVR) may be applied to increase the accuracy of the MVs of the merge mode. Merge mode with MVD (MMVD), which comes from merge mode with motion vector differences. A MMVD flag is signaled right after sending a skip flag and merge flag to specify whether MMVD mode is used for a CU. Moreover, a CU-level adaptive motion vector resolution (AMVR) scheme may be applied. AMVR allows MVD of the CU to be coded in different precision. Dependent on the prediction mode for the current CU, the MVDs of the current CU can be adaptively selected. When a CU is coded in merge mode, the combined inter/intra prediction (CIIP) mode may be applied to the current CU.

Weighted averaging of the inter and intra prediction signals is performed to obtain the CIIP prediction. Affine motion compensated prediction, the affine motion field of the block is described by motion information of two control point (4-parameter) or three control point motion vectors (6-parameter). Sub-block-based temporal motion vector prediction (SbTMVP), which is similar to the temporal motion vector prediction (TMVP) in HEVC, but predicts the motion vectors of the sub-CUs within the current CU. Bi-directional optical flow (BDOF), previously referred to as BIO, is a simpler version that requires much less computation, especially in terms of number of multiplications and the size of the multiplier.

Triangle partition mode, in such a mode, a CU is split evenly into two triangle-shaped partitions, using either the diagonal split or the anti-diagonal split. Besides, the bi-prediction mode is extended beyond simple averaging to allow weighted averaging of the two prediction signals.

The inter prediction unit 244 may include a motion estimation (ME) unit and a motion compensation (MC) unit (both not shown in FIG. 2). The motion estimation unit may be configured to receive or obtain the picture block 203 (current picture block 203 of the current picture 17) and a decoded picture 231, or at least one or a plurality of previously reconstructed blocks, e.g. reconstructed blocks of one or a plurality of other/different previously decoded pictures 231, for motion estimation. E.g., a video sequence may comprise the current picture and the previously decoded pictures 231, or in other words, the current picture and the previously decoded pictures 231 may be part of or form a sequence of pictures forming a video sequence.

The encoder 20 may, e.g., be configured to select a reference block from a plurality of reference blocks of the same or different pictures of the plurality of other pictures and provide a reference picture (or reference picture index) and/or an offset (spatial offset) between the position (x, y coordinates) of the reference block and the position of the current block as inter prediction parameters to the motion estimation unit. This offset is also called motion vector (MV).

The motion compensation unit is configured to obtain, e.g. receive, an inter prediction parameter and to perform inter prediction based on or using the inter prediction parameter to obtain an inter prediction block 265. Motion compensation, performed by the motion compensation unit, may involve fetching or generating the prediction block based on the motion/block vector determined by motion estimation, possibly performing interpolations to sub-pixel precision. Interpolation filtering may generate additional pixel samples from known pixel samples, thus potentially increasing the number of candidate prediction blocks that may be used to code a picture block. Upon receiving the motion vector for the PU of the current picture block, the motion compensation unit may locate the prediction block to which the motion vector points in one of the reference picture lists.

The motion compensation unit may also generate syntax elements associated with the blocks and video slices for use by video decoder 30 in decoding the picture blocks of the video slice.

In addition, or as an alternative to slices and respective syntax elements, tile groups and/or tiles and respective syntax elements may be generated or used.

Entropy Coding

The entropy encoding unit 270 is configured to apply, for example, an entropy encoding algorithm or scheme (e.g. a variable length coding (VLC) scheme, an context adaptive VLC scheme (CAVLC), an arithmetic coding scheme, a binarization, a context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique) or bypass (no compression) on the quantized coefficients 209, inter prediction parameters, intra prediction parameters, loop filter parameters and/or other syntax elements to obtain encoded picture data 21 which can be output via the output 272, e.g. in the form of an encoded bitstream 21, so that, e.g., the video decoder 30 may receive and use the parameters for decoding. The encoded bitstream 21 may be transmitted to video decoder 30, or stored in a memory for later transmission or retrieval by video decoder 30.

Other structural variations of the video encoder 20 can be used to encode the video stream.

For example, a non-transform based encoder 20 can quantize the residual signal directly without the transform processing unit 206 for certain blocks or frames. In another implementation, an encoder 20 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.

Decoder and Decoding Method

FIG. 3 shows an example of a video decoder 30 that is configured to implement the techniques of this present disclosure. The video decoder 30 is configured to receive encoded picture data 21 (e.g. encoded bitstream 21), e.g. encoded by encoder 20, to obtain a decoded picture 331. The encoded picture data or bitstream comprises information for decoding the encoded picture data, e.g. data that represents picture blocks of an encoded video slice (and/or tile groups or tiles) and associated syntax elements.

In the example of FIG. 3, the decoder 30 comprises an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g. a summer 314), a loop filter 320, a decoded picture buffer (DBP) 330, a mode application unit 360, an inter prediction unit 344 and an intra prediction unit 354. Inter prediction unit 344 may be or include a motion compensation unit. Video decoder 30 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 100 from FIG. 2.

As explained with regard to the encoder 20, the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 344 and the intra prediction unit 354 are also referred to as forming the “built-in decoder” of video encoder 20. Accordingly, the inverse quantization unit 310 may be identical in function to the inverse quantization unit 110, the inverse transform processing unit 312 may be identical in function to the inverse transform processing unit 212, the reconstruction unit 314 may be identical in function to reconstruction unit 214, the loop filter 320 may be identical in function to the loop filter 220, and the decoded picture buffer 330 may be identical in function to the decoded picture buffer 230. Therefore, the explanations provided for the respective units and functions of the video 20 encoder apply correspondingly to the respective units and functions of the video decoder 30.

Entropy Decoding

The entropy decoding unit 304 is configured to parse the bitstream 21 (or in general encoded picture data 21) and perform, for example, entropy decoding to the encoded picture data 21 to obtain, e.g., quantized coefficients 309 and/or decoded coding parameters (not shown in FIG. 3), e.g. any or all of inter prediction parameters (e.g. reference picture index and motion vector), intra prediction parameter (e.g. intra prediction mode or index), transform parameters, quantization parameters, loop filter parameters, and/or other syntax elements.

Entropy decoding unit 304 may be configured to apply the decoding algorithms or schemes corresponding to the encoding schemes as described with regard to the entropy encoding unit 270 of the encoder 20. Entropy decoding unit 304 may be further configured to provide inter prediction parameters, intra prediction parameter and/or other syntax elements to the mode application unit 360 and other parameters to other units of the decoder 30. Video decoder 30 may receive the syntax elements at the video slice level and/or the video block level. In addition, or as an alternative to slices and respective syntax elements, tile groups and/or tiles and respective syntax elements may be received and/or used.

Inverse Quantization

The inverse quantization unit 310 may be configured to receive quantization parameters (QP) (or in general information related to the inverse quantization) and quantized coefficients from the encoded picture data 21 (e.g. by parsing and/or decoding, e.g. by entropy decoding unit 304) and to apply based on the quantization parameters an inverse quantization on the decoded quantized coefficients 309 to obtain dequantized coefficients 311, which may also be referred to as transform coefficients 311. The inverse quantization process may include use of a quantization parameter determined by video encoder 20 for each video block in the video slice (or tile or tile group) to determine a degree of quantization and, likewise, a degree of inverse quantization that should be applied.

Inverse Transform

Inverse transform processing unit 312 may be configured to receive dequantized coefficients 311, also referred to as transform coefficients 311, and to apply a transform to the dequantized coefficients 311 in order to obtain reconstructed residual blocks 213 in the sample domain. The reconstructed residual blocks 213 may also be referred to as transform blocks 313. The transform may be an inverse transform, e.g., an inverse DCT, an inverse DST, an inverse integer transform, or a conceptually similar inverse transform process. The inverse transform processing unit 312 may be further configured to receive transform parameters or corresponding information from the encoded picture data 21 (e.g. by parsing and/or decoding, e.g. by entropy decoding unit 304) to determine the transform to be applied to the dequantized coefficients 311.

Reconstruction

The reconstruction unit 314 (e.g. adder or summer 314) may be configured to add the reconstructed residual block 313, to the prediction block 365 to obtain a reconstructed block 315 in the sample domain, e.g. by adding the sample values of the reconstructed residual block 313 and the sample values of the prediction block 365.

Filtering

The loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter the reconstructed block 315 to obtain a filtered block 321, e.g. to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 320 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, e.g. an adaptive loop filter (ALF), a noise suppression filter (NSF), or any combination thereof. In an example, the loop filter unit 220 may comprise a de-blocking filter, a SAO filter and an ALF filter. The order of the filtering process may be the deblocking filter, SAO and ALF. In another example, a process called the luma mapping with chroma scaling (LMCS) (namely, the adaptive in-loop reshaper) is added. This process is performed before deblocking. In another example, the deblocking filter process may be also applied to internal sub-block edges, e.g. affine sub-blocks edges, ATMVP sub-blocks edges, sub-block transform (SBT) edges and intra sub-partition (ISP) edges. Although the loop filter unit 320 is shown in FIG. 3 as being an in-loop filter, in other configurations, the loop filter unit 320 may be implemented as a post loop filter.

Decoded Picture Buffer

The decoded video blocks 321 of a picture are then stored in decoded picture buffer 330, which stores the decoded pictures 331 as reference pictures for subsequent motion compensation for other pictures and/or for output respectively display.

The decoder 30 is configured to output the decoded picture 311, e.g. via output 312, for presentation or viewing to a user.

Prediction

The inter prediction unit 344 may be identical to the inter prediction unit 244 (in particular to the motion compensation unit) and the intra prediction unit 354 may be identical to the inter prediction unit 254 in function, and performs split or partitioning decisions and prediction based on the partitioning and/or prediction parameters or respective information received from the encoded picture data 21 (e.g. by parsing and/or decoding, e.g. by entropy decoding unit 304). Mode application unit 360 may be configured to perform the prediction (intra or inter prediction) per block based on reconstructed pictures, blocks or respective samples (filtered or unfiltered) to obtain the prediction block 365.

When the video slice is coded as an intra coded (I) slice, intra prediction unit 354 of mode application unit 360 is configured to generate prediction block 365 for a picture block of the current video slice based on a signaled intra prediction mode and data from previously decoded blocks of the current picture. When the video picture is coded as an inter coded (i.e., B, or P) slice, inter prediction unit 344 (e.g. motion compensation unit) of mode application unit 360 is configured to produce prediction blocks 365 for a video block of the current video slice based on the motion vectors and other syntax elements received from entropy decoding unit 304. For inter prediction, the prediction blocks may be produced from one of the reference pictures within one of the reference picture lists. Video decoder 30 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference pictures stored in DPB 330. The same or similar may be applied for or by embodiments using tile groups (e.g. video tile groups) and/or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and/or tiles.

Mode application unit 360 is configured to determine the prediction information for a video block of the current video slice by parsing the motion vectors or related information and other syntax elements, and uses the prediction information to produce the prediction blocks for the current video block being decoded. For example, the mode application unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code the video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for the slice, motion vectors for each inter encoded video block of the slice, inter prediction status for each inter coded video block of the slice, and other information to decode the video blocks in the current video slice. The same or similar may be applied for or by embodiments using tile groups (e.g. video tile groups) and/or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and/or tiles.

Embodiments of the video decoder 30 as shown in FIG. 3 may be configured to partition and/or decode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or decoded using one or more slices (typically non-overlapping), and each slice may comprise one or more blocks (e.g. CTUs) or one or more groups of blocks (e.g. tiles (H.265/HEVC and VVC) or bricks (VVC)).

Embodiments of the video decoder 30 as shown in FIG. 3 may be configured to partition and/or decode the picture by using slices/tile groups (also referred to as video tile groups) and/or tiles (also referred to as video tiles), wherein a picture may be partitioned into or decoded using one or more slices/tile groups (typically non-overlapping), and each slice/tile group may comprise, e.g. one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile, e.g. may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks.

Other variations of the video decoder 30 can be used to decode the encoded picture data 21. For example, the decoder 30 can produce the output video stream without the loop filtering unit 320. For example, a non-transform based decoder 30 can inverse-quantize the residual signal directly without the inverse-transform processing unit 312 for certain blocks or frames.

In another implementation, the video decoder 30 can have the inverse-quantization unit 310 and the inverse-transform processing unit 312 combined into a single unit.

It should be understood that, in the encoder 20 and the decoder 30, a processing result of a current step may be further processed and then output to the next step. For example, after interpolation filtering, motion vector derivation or loop filtering, a further operation, such as Clip or shift, may be performed on the processing result of the interpolation filtering, motion vector derivation or loop filtering.

It should be noted that further operations may be applied to the derived motion vectors of current block (including but not limit to control point motion vectors of affine mode, sub-block motion vectors in affine, planar, ATMVP modes, temporal motion vectors, and so on).

For example, the value of motion vector is constrained to a predefined range according to its representing bit. If the representing bit of motion vector is bitDepth, then the range is −2{circumflex over ( )}(bitDepth-1)˜2{circumflex over ( )}(bitDepth-1)−1, where “{circumflex over ( )}” means exponentiation. For example, if bitDepth is set equal to 16, the range is −32768˜32767; if bitDepth is set equal to 18, the range is −131072˜131071. For example, the value of the derived motion vector (e.g. the MVs of four 4×4 sub-blocks within one 8×8 block) is constrained such that the max difference between integer parts of the four 4×4 sub-block MVs is no more than N pixels, such as no more than 1 pixel. Here are provided two methods for constraining the motion vector according to the bitDepth.

FIG. 4 is a schematic diagram of a video coding device 400 according to an embodiment of the disclosure. The video coding device 400 is suitable for implementing the disclosed embodiments as described herein. In an embodiment, the video coding device 400 may be a decoder such as video decoder 30 of FIG. 1A or an encoder such as video encoder 20 of FIG. 1A.

The video coding device 400 comprises ingress ports 410 (or input ports 410) and receiver units (Rx) 420 for receiving data; a processor, logic unit, or central processing unit (CPU) 430 to process the data; transmitter units (Tx) 440 and egress ports 450 (or output ports 450) for transmitting the data; and a memory 460 for storing the data. The video coding device 400 may also comprise optical-to-electrical (OE) components and electrical-to-optical (EO) components coupled to the ingress ports 410, the receiver units 420, the transmitter units 440, and the egress ports 450 for egress or ingress of optical or electrical signals.

The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGAs, ASICs, and DSPs. The processor 430 is in communication with the ingress ports 410, receiver units 420, transmitter units 440, egress ports 450, and memory 460. The processor 430 comprises a coding module 470. The coding module 470 implements the disclosed embodiments described above. For instance, the coding module 470 implements, processes, prepares, or provides the various coding operations. The inclusion of the coding module 470 therefore provides a substantial improvement to the functionality of the video coding device 400 and effects a transformation of the video coding device 400 to a different state.

Alternatively, the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430.

The memory 460 may comprise one or more disks, tape drives, and solid-state drives and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution. The memory 460 may be, for example, volatile and/or non-volatile and may be a read-only memory (ROM), random-access memory (RAM), ternary content-addressable memory (TCAM), and/or static random-access memory (SRAM).

FIG. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of the source device 12 and the destination device 14 from FIG. 1 according to an exemplary embodiment.

A processor 502 in the apparatus 500 can be a central processing unit. Alternatively, the processor 502 can be any other type of device, or multiple devices, capable of manipulating or processing information now existing or hereafter developed. Although the disclosed implementations can be practiced with a single processor as shown, e.g., the processor 502, advantages in speed and efficiency can be achieved using more than one processor.

A memory 504 in the apparatus 500 can be a read only memory (ROM) device or a random-access memory (RAM) device in an implementation. Any other suitable type of storage device can be used as the memory 504. The memory 504 can include code and data 506 that is accessed by the processor 502 using a bus 512. The memory 504 can further include an operating system 508 and application programs 510, the application programs 510 including at least one program that permits the processor 502 to perform the methods described here.

For example, the application programs 510 can include applications 1 through N, which further include a video coding application that performs the methods described here.

The apparatus 500 can also include one or more output devices, such as a display 518. The display 518 may be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs. The display 518 can be coupled to the processor 502 via the bus 512.

Although depicted here as a single bus, the bus 512 of the apparatus 500 can be composed of multiple buses. Further, the secondary storage 514 can be directly coupled to the other components of the apparatus 500 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards. The apparatus 500 can thus be implemented in a wide variety of configurations.

Affine Motion Compensated Prediction

In ITU-T H.265 (HEVC), only a translation motion model is applied for motion compensation prediction (MCP). In the real world, however, there are many kinds of motion, e.g. zoom in/out, rotation, perspective motions and the other irregular motions. In the VTM6, a block-based affine transform motion compensation prediction is applied. As shown in FIG. 6, the affine motion field of a block is described by motion information of two control point (4-parameter) or three control point motion vectors (CPMV) (6-parameter).

The general equation for calculation of a motion vector at sample location (x, y) is:

$\begin{matrix} \left\{ {\begin{matrix} {{mv}_{x} = {{{dHorX}*x} + {{dVerX}*y} + {mv}_{0x}}} \\ {{mv}_{y} = {{{dHorY}*x} + {{dVerY}*y} + {mv}_{0y}}} \end{matrix}\quad} \right. & \left( {1\text{-}1} \right) \end{matrix}$

For the 4-parameter affine motion model, the motion vector at sample location (x, y) is derived as:

$\begin{matrix} \left\{ {\begin{matrix} {{mv}_{x} = {{\frac{{mv}_{1x} - {mv}_{0x}}{W}x} + {\frac{{mv}_{0y} - {mv}_{1y}}{W}y} + {mv}_{0x}}} \\ {{mv}_{y} = {{\frac{{mv}_{1y} - {mv}_{0y}}{W}x} + {\frac{{mv}_{1x} - {mv}_{0x}}{W}y} + {mv}_{0y}}} \end{matrix}\quad} \right. & \left( {1\text{-}2} \right) \end{matrix}$

For the 6-parameter affine motion model, the motion vector at sample location (x, y) is derived as:

$\begin{matrix} \left\{ {\begin{matrix} {{mv}_{x} = {{\frac{{mv}_{1x} - {mv}_{0x}}{W}x} + {\frac{{mv}_{2x} - {mv}_{0x}}{H}y} + {mv}_{0x}}} \\ {{mv}_{y} = {{\frac{{mv}_{1y} - {mv}_{0y}}{W}x} + {\frac{{mv}_{2y} - {mv}_{0y}}{H}y} + {mv}_{0y}}} \end{matrix}\quad} \right. & \left( {1\text{-}3} \right) \end{matrix}$

where (mv_(0x), mv_(0y)) is motion vector of the top-left corner control point, (mv_(1x), mv_(1y)) is motion vector of the top-right corner control point, and (mv_(2x), mv_(2y)) is motion vector of the bottom-left corner control point; where W is the width of the block and H is the height of the block.

For the case of using the 6-parameter affine motion model

$\begin{matrix} {{{dHorX} = \frac{{mv}_{1x} - {mv}_{0x}}{W}},} & \left( {1\text{-}4} \right) \\ {{{dHorY} = \frac{{mv}_{1y} - {mv}_{0y}}{W}},} & \left( {1\text{-}5} \right) \\ {{{dVerX} = \frac{{mv}_{2x} - {mv}_{0x}}{H}},} & \left( {1\text{-}6} \right) \\ {{{dVerY} = \frac{{mv}_{2y} - {mv}_{0y}}{H}},} & \left( {1\text{-}7} \right) \end{matrix}$

For the case of using the 4-parameter affine motion model,

$\begin{matrix} {{{dHorX} = \frac{{mv}_{1x} - {mv}_{0x}}{W}},} & \left( {1\text{-}8} \right) \\ {{{dHorY} = \frac{{mv}_{1y} - {mv}_{0y}}{W}},} & \left( {1\text{-}9} \right) \\ {{{dVerX} = {- {dHorY}}},} & \left( {1\text{-}10} \right) \\ {{dVerY} = {{dHorX}.}} & \left( {1\text{-}11} \right) \end{matrix}$

As for translational motion inter prediction, there are also two affine motion inter prediction modes: affine merge mode and affine AMVP mode.

Block Based Affine Transform Prediction

In order to simplify the motion compensation prediction, block-based affine transform prediction is applied. To derive a motion vector of each 8×8 luma sub-block, the motion vector of the center sample of each sub-block, as shown in FIG. 7, is calculated according to the above equations, and rounded to 1/16 fraction accuracy. Then the motion compensation interpolation filters are applied, to generate the prediction of each sub-block with the derived motion vector. The sub-block size of chroma-components is set to be 4×4.

Enhanced Bilinear Interpolation Filter

Filtering using Enhanced bilinear Interpolation Filter (EIF) can be used for a prediction block and on a sub-block basis. The filtering procedure is the same for luma and for chroma signals.

The filtering procedure comprises the following steps:

-   -   E1. Deriving pixel-based motion vector field from the CPMVs,         according to equation (1-1);     -   E2. Obtaining interpolated samples based on the derived motion         vectors, using bilinear interpolation for the fractional         offsets;     -   E3. Performing horizontal and then vertical filtering using         fixed −3-tap high-pass filter [−1, 10, −1] with normalization         factor of 8.

The first two steps, E1 and E2, are performed for a (W+2)×(H+2) area, where W and H are the prediction block width and height correspondingly. One pixel margin from each border is added for applying a 3-tap filter of the third step, E3. The original affine block and the corresponding (W+2)×(H+2) block that is used in the intermediate step of EIF are depicted in FIG. 8.

Memory Bandwidth Calculation

The memory bandwidth is calculated as a reference block to current block area ratio. For example, for an 8×8 bi-predictive block using an interpolation filter with T taps, the reference area value is Sr is equal to 2(8+T−1)(8+T−1), block area Sb is equal to 8*8. Therefore, the memory bandwidth is

${MB}_{8 \times 8} = {\frac{2\left( {8 + T - 1} \right)\left( {8 + T - 1} \right)}{64}.}$

For the 8-tap discrete cosine transform interpolation filter, DCTIF, which is used in ITU-T H.265, VVC and EVC, the memory bandwidth is

${MB_{8 \times 8}} = {\frac{2*15*15}{64} = {{7.0}312{5.}}}$

Sub-block affine motion compensation prediction with a minimal sub-block size 8×8 (as used in EVC) does not increase the memory bandwidth compared to ITU-T H.265, because 8×8 bi-predictive blocks represent the worst case for ITU-T H.265 in terms of memory bandwidth calculation. In case of using EIF for motion compensation of affine block memory bandwidth for some affine motion model parameters can be greater than ITU-T H.265 worst case. Embodiments of the current disclosure provide motion model constraints that guarantee the memory bandwidth for EIF is not larger than for the worst case of memory bandwidth calculation of ITU-T H.265 (8×8 bi-predictive blocks). Moreover, affine motion model constraints for any desirable memory bandwidth worst case can be obtained.

Embodiment 1

Memory Access Consumption Calculation for Affine Block in Case of Usage EIF

When EIF is used for motion compensation of affine block with size W×H, the following steps are performed for memory access consumption calculation.

-   1. Derive the location of each corner sample of the affine block. -   2. Derive the location of each corner sample of the block, which are     used on step, 3 of EIF (denote it as the EIF intermediate block). -   3. Derive motion vectors for each corner sample of the EIF     intermediate block. -   E4. Derive location of the transformed block in the reference     picture. -   E5. Derive the bounding box size for the transformed block. -   E6. Get the memory access consumption based on the size of the     transformed block and filter length (EIF uses bilinear     interpolation, so filter length is equal to 2).

The details of the implementation of these steps are described below.

Step 1. Derive the Location of Each Corner Sample of the Affine Block

Let us denote (x0, y0) as the coordinate of the top-left sample of the affine block. Then the location of the affine block can be described by the coordinates of its corner samples (top-left, top-right, bottom-left, bottom-right):

$\begin{matrix} \left\{ \begin{matrix} {\left( {x_{0},y_{0}} \right) = \left( {x_{0},y_{0}} \right)} \\ {\left( {x_{1},y_{1}} \right) = \left( {{x_{0} + W - 1},y_{0}} \right)} \\ {\left( {x_{2},y_{2}} \right) = \left( {x_{0},{y_{0} + H - 1}} \right)} \\ {\left( {x_{3},y_{3}} \right) = \left( {{x_{0} + W - 1},{y_{0} + H - 1}} \right)} \end{matrix} \right. & \left( {2\text{-}1} \right) \end{matrix}$

Step 2. Derive the Location of Each Corner Sample of the EIF Intermediate Block

Bilinear interpolation at the step E2 of EIF is performed for a block of size (W+2)×(H+2) (one pixel margin from each border is added). This block may also be called a (W+2)×(H+2) block. This (W+2)×(H+2) block is denoted as intermediate EIF block. The coordinates of intermediate EIF block corner samples (top-left, top-right, bottom-left, bottom-right) are:

$\begin{matrix} \left\{ \begin{matrix} {\left( {X_{0},Y_{0}} \right) = \left( {{x_{0} - 1},{y_{0} - 1}} \right)} \\ {\left( {X_{1},Y_{1}} \right) = \left( {{x_{0} + W},{y_{0} - 1}} \right)} \\ {\left( {X_{2},Y_{2}} \right) = \left( {{x_{0} - 1},{y_{0} + H}} \right)} \\ {\left( {X_{3},Y_{3}} \right) = \left( {{x_{0} + W},{y_{0} + H}} \right)} \end{matrix} \right. & \left( {2\text{-}2} \right) \end{matrix}$

The coordinates of the corners of the affine block and of the intermediate EIF block are depicted in FIG. 8.

Step 3. Derive Motion Vectors for Each Corner Sample of EIF Intermediate Block

Motion vectors are derived according to equation (1-1). In some examples, motion vector clipping can be used to guarantee that samples outside of the current picture with margin of one CTU size are not used.

$\begin{matrix} \left\{ \begin{matrix} {V_{0} = {V_{X_{0},Y_{0}} = \left( {{{mv_{0x}} + {\left( {- 1} \right){dHorX}} + {\left( {- 1} \right){dVerX}}},{{mv}_{oy} + {\left( {- 1} \right){dHorY}} + {\left( {- 1} \right){dVerY}}}} \right)}} \\ {V_{1} = {V_{X_{1},Y_{1}} = \left( {{{mv_{0x}} + {(W){dHorX}} + {\left( {- 1} \right){dVerX}}},{{mv}_{oy} + {(W){dHorY}} + {\left( {- 1} \right){dVerY}}}} \right)}} \\ {V_{2} = {V_{X_{2},Y_{2}} = \left( {{{mv_{0x}} + {\left( {- 1} \right){dHorX}} + {(H){dVerX}}},{{mv}_{oy} + {\left( {- 1} \right){dHorY}} + {(H){dVerY}}}} \right)}} \\ {V_{3} = {V_{X_{3},Y_{3}} = \left( {{{mv_{0x}} + {(W){dHorX}} + {(H){dVerX}}},{{mv}_{oy} + {(W){dHorY}} + {(H){dVerY}}}} \right)}} \end{matrix} \right. & \left( {2\text{-}3} \right) \end{matrix}$

Step 4. Derive Location of Transformed Block in Reference Picture

Denote horizontal and vertical parts of vector Vi as V_(ix) and V_(iy) respectively.

The location of the transformed block in reference picture can be described by the coordinates of its corner samples (top-left, top-right, bottom-left, bottom-right):

$\begin{matrix} \left\{ \begin{matrix} {\left( {X_{0}^{\prime},\ Y_{0}^{\prime}} \right) = \left( {{X_{0} + V_{0x}},{Y_{0} + V_{0y}}} \right)} \\ {\left( {X_{1}^{\prime},\ Y_{1}^{\prime}} \right) = \left( {{X_{1} + V_{1x}},{Y_{1} + V_{1y}}} \right)} \\ {\left( {X_{2}^{\prime},\ Y_{2}^{\prime}} \right) = \left( {{X_{2} + V_{2x}},{Y_{2} + V_{2y}}} \right)} \\ {\left( {X_{3}^{\prime},\ Y_{3}^{\prime}} \right) = \left( {{X_{3} + V_{3x}},{Y_{3} + V_{3y}}} \right)} \end{matrix} \right. & \left( {2\text{-}4} \right) \end{matrix}$

Step 5. Derive the Bounding Box Size for the Transformed Block

The bounding box size for transformed block in reference picture can be calculated by following equation, where max function returns the maximum value of the arguments, min function returns the minimum value of the arguments:

$\begin{matrix} \left\{ \begin{matrix} {W^{\prime} = {{\max\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)} - {\min\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)}\  + 1}} \\ {H^{\prime} = {{\max\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} - {\min\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} + 1}} \end{matrix} \right. & \left( {2\text{-}5} \right) \end{matrix}$

The location of the transformed block in the reference picture and the corresponding bounding box are depicted in FIG. 9.

In one example, W′=Ceil(W′), H′=Ceil(H′) is performed after equation (2-5).

In another example, W′=Floor(W′), H′=Floor(H′) is performed after equation (2-5).

Step 6. Get the Memory Access Consumption

The memory access consumption of the affine block in one reference picture can be decided, by the bounding box size for the transformed block transformed block and the length of MC interpolation filter for affine motion block T′, e.g., 2, 4, 6, 8 . . . :

Mem=(W′+T′−1)*(H′+T′−1)  (2-6)

For EIF, bilinear interpolation is used, therefore filter length is 2 and memory access consumption is equal to

Mem=(W′+1)*(H′+1)  (2-7)

Affine Motion Model Restrictions for EIF

We denote the target worst case memory bandwidth as T=S_(wc)/W*H, where W and H are current block width and heights respectively, and S_(wc) is maximum allowed memory access consumption for the current block, according to the target case memory bandwidth. To guarantee that EIF memory bandwidth is not greater that the target case memory bandwidth, the memory access consumption of affine block should be constrained as following condition:

$\begin{matrix} {{\frac{\left( {W^{\prime} + 1} \right)*\left( {H^{\prime} + 1} \right)}{W*H} \leq T}{{{{or}\left( {W^{\prime} + 1} \right)}*\left( {H^{\prime} + 1} \right)} \leq {T*W*H}}{{{{or}\left( {W^{\prime} + 1} \right)}*\left( {H^{\prime} + 1} \right)} \leq S_{wc}}} & \left( {2\text{-}8} \right) \end{matrix}$

The value T can be predefined in both encoder and decoder, or specified in a parameter set of a codec video sequence, e.g., sequence levels, picture level, slice level parameter set, etc.

In one example, if the maximum allowed memory access consumption per sample is defined as the memory access consumption of a 4×4 block, then T can be derived as follows, where T is the length of interpolation filter:

$\begin{matrix} {T = \frac{\left( {4 + T^{\prime} - 1} \right)*\left( {4 + T^{\prime} - 1} \right)}{4*4}} & \left( {2\text{-}9} \right) \end{matrix}$

For T′ equal to 6 the restriction is as follows:

(W′+1)*(H′+1)≤(4+6−1)*(4+6−1)  (2-10)

In another example, if the maximum allowed memory access consumption per sample is defined as the memory access consumption of an 8×8 block, then T can be derived as follows, where T is the length of interpolation filter:

$\begin{matrix} {T = \frac{\left( {8 + T^{\prime} - 1} \right)*\left( {8 + T^{\prime} - 1} \right)}{8*8}} & \left( {2\text{-}11} \right) \end{matrix}$

In another example, the maximum allowed memory access consumption of per sample can be different according the prediction direction of current block, i.e.: when current block is uni-prediction, use threshold T_(UNI), when the current block is bi-predicted, use a threshold T_(BI).

For example, T_(UNI) is defined as the memory access consumption of 4×4 block, T_(BI) is defined as the memory access consumption of 8×4 block, then:

$\begin{matrix} {T_{UNI} = \frac{\left( {4 + T^{\prime} - 1} \right)*\left( {4 + T^{\prime} - 1} \right)}{4*4}} & \left( {2\text{-}12} \right) \\ {T_{Bi} = \frac{\left( {8 + T^{\prime} - 1} \right)*\left( {4 + T^{\prime} - 1} \right)}{8*4}} & \left( {2\text{-}13} \right) \end{matrix}$

In another example, T_(UNI) is defined as the memory access consumption of 4×4 block, T_(BI) is defined as the memory access consumption of 8×8 block, then:

$\begin{matrix} {T_{UNI} = \frac{\left( {4 + T^{\prime} - 1} \right)*\left( {4 + T^{\prime} - 1} \right)}{4*4}} & \left( {2\text{-}14} \right) \\ {T_{Bi} = \frac{\left( {8 + T^{\prime} - 1} \right)*\left( {8 + T^{\prime} - 1} \right)}{8*4}} & \left( {2\text{-}15} \right) \end{matrix}$

T′ in the examples above is the length of motion compensation (MC) interpolation filter for translational motion block, e.g., 2, 4, 6, 8 . . . .

The value of T, T_(UNI) and T_(BI) may depend on width and height of the current block.

For bi-prediction affine block, the above constraint is applied to both list0 and list1, individually.

In another example, memory access consumption is calculated for list0 and for list1 as Mem₀ and Mem₁, and sum of these elements is restricted. For example, if the T_(BI) is defined as the memory access consumption of 8×8 block, the following restriction is used:

Mem₀+Mem₁≤2*(8+T′−1)*(8+T′−1)  (2-16)

If the motion vectors of the affine block cannot follow the constraint conditions (2-8), the block cannot use EIF motion compensation.

In one example, if the affine block cannot use EIF motion compensation, sub-block motion compensation with minimum sub-block size 8×8 is used instead of EIF.

In another example, if the affine block cannot use EIF motion compensation, translational motion compensation with motion vector calculated for the center of the affine block is used instead of EIF.

In another example, if the affine block cannot use EIF motion compensation, the bounding box is derived based on W′ and H′ for those inequality (2-8) is satisfied. For example W′ and H′ can be calculated as:

W′=√{square root over (T*W*H)}−1

H′=√{square root over (T*W*H)}−1

After that during MV calculation in EIF according to equation (1-1), the horizontal part of motion vectors is clipped to the range [mv_(0x), mv_(0x)+W′−1], and vertical part of motion vectors is clipped to the range [mv_(0y), mv_(0y)+H′−1]. In one example, if block aspect ratio is k (W=kH), H′ is calculated by solving the equation

k(H′)²+(k+1)H′+1−TWH=0

and performing the following steps: H′=Floor(H′), W′=kH′.

Embodiment 2

Memory access consumption calculation for affine block in case of usage EIF The difference between embodiment 1 and embodiment 2 is that, in context of embodiment 2, it is supposed that EIF motion compensation is performed sub-block by sub-block with sub-block size W×H. In one example, W is equal to H. In one example W=4, H=4. In one example, W=8, H=8.

The following steps are performed for memory access consumption calculation.

-   -   1. Derive the location of each corner sample of the W×H         sub-block.     -   2. Derive the location of each corner sample of the sub-block         used on step E3 of EIF (denote it as EIF intermediate         sub-block).     -   3. Derive motion vectors for each corner sample of EIF         intermediate sub-block.     -   4. Derive location of transformed sub-block in reference         picture.     -   5. Derive the bounding box size for the transformed sub-block.     -   6. Get the memory access consumption based on the bounding box         size for transformed sub-block size and filter length (EIF uses         bilinear interpolation, so filter length is equal to 2).

The details of implementation of these steps are described below.

Step 1. Derive the Location of Each Corner Sample of the Affine Sub-Block

Let us denote (x0, y0) as the coordinate of the top-left sample of the affine block. In this embodiment for memory access consumption calculation, it is supposed that coordinate of the top-left sample of the affine sub-block is equal to (1, 1). The position (x₀, y₀) does not make sense for memory access consumption calculation and with (x₀, y₀)=(1, 1) the equations are simpler.

Then the location of the affine sub-block can be described by the coordinates of its corner samples (top-left, top-right, bottom-left, bottom-right):

$\begin{matrix} \left\{ \begin{matrix} {\left( {x_{0},y_{0}} \right) = \left( {1,1} \right)} \\ {\left( {x_{1},y_{1}} \right) = \left( {W,1} \right)} \\ {\left( {x_{2},y_{2}} \right) = \left( {1,H} \right)} \\ {\left( {x_{3},y_{3}} \right) = \left( {W,H} \right)} \end{matrix} \right. & \left( {3\text{-}1} \right) \end{matrix}$

Step 2. Derive the Location of Each Corner Sample of the EIF Intermediate Sub-Block

Since EIF uses a 3-tap filter at the step E3, bilinear interpolation at step 2 of EIF is performed for a sub-block of size (W+2)×(H+2) (one pixel margin from each border is added). Such a sub-block may also be called a (W+2)×(H+2) sub-block. Here W×H is affine block (affine sub-block) size. This (W+2)×(H+2) sub-block is denoted as an intermediate EIF sub-block. The coordinates of the intermediate EIF block corner samples (top-left, top-right, bottom-left, bottom-right) are:

$\begin{matrix} \left\{ \begin{matrix} {\left( {X_{0},Y_{0}} \right) = \left( {0,0} \right)} \\ {\left( {X_{1},Y_{1}} \right) = \left( {{1 + W},0} \right)} \\ {\left( {X_{2},Y_{2}} \right) = \left( {0,{1 + H}} \right)} \\ {\left( {X_{3},Y_{3}} \right) = \left( {{1 + W},{1 + H}} \right)} \end{matrix} \right. & \left( {3\text{-}2} \right) \end{matrix}$

The coordinates of the corners of the affine sub-block and of the intermediate EIF sub-block are depicted in FIG. 8. The length of each line of EIF intermediate block is (W+2).

Step 3. Derive Motion Vectors for Each Corner Sample of EIF Intermediate Sub-Block

The initial motion vector (mv_(0x), mv_(0y)) does not make sense for memory access consumption calculation and with (mv_(0x), mv_(0y))=(dHorX+dVerX, dHorY+dVerY) the equations are simpler.

Motion vectors are derived according to equation (1-1).

$\begin{matrix} {\quad\left\{ \begin{matrix} {V_{0} = {V_{X_{0},Y_{0}} = \left( {0,0} \right)}} \\ {V_{1} = {V_{X_{1},Y_{1}} = \left( {{\left( {W + 1} \right){dHorX}},{\left( {W + 1} \right){dHorY}}} \right)}} \\ {V_{2} = {V_{X_{2},Y_{2}} = \left( {{\left( {H + 1} \right){dVerX}},{\left( {H + 1} \right){dVerY}}} \right)}} \\ {V_{3} = {V_{X_{3},Y_{3}} = \left( {{{\left( {W + 1} \right){dHorX}} + {\left( {H + 1} \right){dVerX}}},\ {{\left( {W + 1} \right){dHorY}} + {\left( {H + 1} \right){dVerY}}}} \right)}} \end{matrix} \right.} & \left( {3\text{-}3} \right) \end{matrix}$

Step 4. Derive Location of Transformed Block in Reference Picture

The location of the transformed block in reference picture can be described by the coordinates of its corner samples (top-left, top-right, bottom-left, bottom-right):

$\begin{matrix} \left\{ \begin{matrix} {\left( {X_{0}^{\prime},Y_{0}^{\prime}} \right) = \left( {0,0} \right)} \\ {\left( {X_{1}^{\prime},Y_{1}^{\prime}} \right) = \left( {{1 + W + {\left( {W + 1} \right){dHorX}}},{\left( {W + 1} \right){dHorY}}} \right)} \\ {\left( {X_{2}^{\prime},Y_{2}^{\prime}} \right)\left( {{\left( {H + 1} \right){dVerX}},{1 + H + {\left( {H + 1} \right){dVerY}}}} \right)} \\ {\left( {X_{3}^{\prime},Y_{3}^{\prime}} \right) = \left( {{1 + W + {\left( {W + 1} \right){dHorX}} + {\left( {H + 1} \right){dVerX}}},{1 + H + {\left( {W + 1} \right){dHorY}} + {\left( {H + 1} \right){dVerY}}}} \right)} \end{matrix} \right. & \left( {2\text{-}4} \right) \end{matrix}$

Step 5. Derive the Bounding Box Size for the Transformed Sub-Block

The bounding box size for transformed sub-block in reference picture can be calculated by following equation, where max function returns the maximum value of the arguments, min function returns the minimum value of the arguments:

$\begin{matrix} \left\{ \begin{matrix} {W^{\prime} = {{\max\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)} - {\min\left( {X_{0}^{\prime},X_{1}^{\prime},X_{2}^{\prime},X_{3}^{\prime}} \right)} + 1}} \\ {{H^{\prime} = {{\max\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} - {\min\left( {Y_{0}^{\prime},Y_{1}^{\prime},Y_{2}^{\prime},Y_{3}^{\prime}} \right)} + 1}}\mspace{31mu}} \end{matrix} \right. & \left( {3\text{-}5} \right) \end{matrix}$

The location of transformed sub-block in reference picture and corresponding bounding box are depicted in FIG. 9.

In one example W′=Ceil(W′), H′=Ceil(H′) is performed after equation (3-5).

In another example W′=Floor(W′), H′=Floor(H′) is performed after equation (3-5).

Step 6. Get the Memory Access Consumption

The memory access consumption of the affine sub-block in one reference picture can be decided, by the bounding box size for the transformed sub-block size and the length of MC interpolation filter for affine motion block T′, e.g., 2, 4, 6, 8 . . . :

Mem=(W′+T′−1)*(H′+T′−1)  (3-6)

For EIF, bilinear interpolation is used, therefore filter length is 2 and memory access consumption is equal to

Mem=(W′+1)*(H′+1)  (3-7)

Affine Motion Model Restrictions for EIF

Let us denote a target worst case memory bandwidth as

${T = \frac{S_{wc}}{W*H}},$

where W and H are current sub-block width and heights respectively, and S_(wc) is maximum allowed memory access consumption for the current sub-block, according to the target case memory bandwidth. To guarantee that EIF memory bandwidth is not greater than the target case memory bandwidth, the memory access consumption of EIF sub-block should be constrained as following condition:

$\begin{matrix} {{\frac{\left( {W^{\prime} + 1} \right)*\left( {H^{\prime} + 1} \right)}{W*H} \leq T}{{{{or}\left( {W^{\prime} + 1} \right)}*\left( {H^{\prime} + 1} \right)} \leq {T*W*H}}{{{{or}\left( {W^{\prime} + 1} \right)}*\left( {H^{\prime} + 1} \right)} \leq S_{wc}}} & \left( {3\text{-}8} \right) \end{matrix}$

The value T can be predefined in both encoder and decoder, or specified in a parameter set of a codec video sequence, e.g., sequence levels, picture level, slice level parameter set, etc.

In one example, if the maximum allowed memory access consumption per sample is defined as the memory access consumption of a 4×4 block, then T can be derived as follows, where T is the length of interpolation filter:

$\begin{matrix} {T = \frac{\left( {4 + {T\;\prime} - 1} \right)*\left( {4 + {T\;\prime} - 1} \right)}{4*4}} & \left( {3\text{-}9} \right) \end{matrix}$

For T′ equal to 6 the restriction is as follows:

(W′+1)*(H′+1)≤(4+6−1)*(4+6−1)  (3-10)

In another example, if the maximum allowed memory access consumption per sample is defined as the memory access consumption of an 8×8 block, then T can be derived as follows, where T is the length of interpolation filter:

$\begin{matrix} {T = \frac{\left( {8 + {T\;\prime} - 1} \right)*\left( {8 + {T\;\prime} - 1} \right)}{8*8}} & \left( {3\text{-}11} \right) \end{matrix}$

In another example, the maximum allowed memory access consumption of per sample can be different according the prediction direction of current block, i.e.: when current block is uni-predicted, use a threshold T_(UNI), when the current block is bi-predicted, use a threshold T_(BI).

For example, T_(UNI) is defined as the memory access consumption of 4×4 block, T_(BI) is defined as the memory access consumption of 8×4 block, then:

$\begin{matrix} {T_{UNI} = \frac{\left( {{4*T\;\prime} - 1} \right)*\left( {4 + {T\;\prime} - 1} \right)}{4*4}} & \left( {3\text{-}12} \right) \\ {T_{Bi} = \frac{\left( {8 + {T\;\prime} - 1} \right)*\left( {4 + {T\;\prime} - 1} \right)}{8*4}} & \left( {3\text{-}13} \right) \end{matrix}$

In another example, T_(UNI) is defined as the memory access consumption of 4×4 block, T_(BI) is defined as the memory access consumption of 8×8 block, then:

$\begin{matrix} {T_{UNI} = \frac{\left( {{4*T\;\prime} - 1} \right)*\left( {4 + {T\;\prime} - 1} \right)}{4*4}} & \left( {3\text{-}14} \right) \\ {T_{Bi} = \frac{\left( {8 + {T\;\prime} - 1} \right)*\left( {8 + {T\;\prime} - 1} \right)}{8*8}} & \left( {3\text{-}15} \right) \end{matrix}$

T′ in the examples above is the length of motion compensation (MC) interpolation filter for translational motion block, e.g., 2, 4, 6, 8 . . . .

The value of T, T_(UNI) and T_(BI) may depend on width and height of the current block.

For the bi-predicted affine block, the above constraint is applied to both list0 and list1, individually.

In another example, memory access consumption is calculated for list0 and for list1 as Mem₀ and Mem₁ and sum of these elements is restricted. For example if the T_(BI) is defined as the memory access consumption of 8×8 block the following restriction is used:

Mem ₀+Mem₁≤2*(8+T′−1)*(8+T′−1)  (3-16)

In this example, if the motion vectors of the affine block cannot follow the constraint conditions (3-8), the block cannot use EIF motion compensation.

In one example if the affine block cannot use EIF motion compensation, sub-block motion compensation with minimum sub-block size 8×8 is used instead of EIF.

In another example if the affine block cannot use EIF motion compensation, translational motion compensation with motion vector calculated for the center of the affine block is used instead of EIF.

In another example if the affine block cannot use EIF motion compensation, the bounding box is derived based on W′ and H′ for those inequality (3-8) is satisfied. For example W′ and H′ can be calculated as:

W′=√{square root over (T*W*H)}−1

H′=√{square root over (T*W*H)}−1

After that during MV calculation in EIF according to equation (1-1), the horizontal part of motion vectors is clipped to the range [mv_(0x), mv_(0x)+W′−1] and vertical part of motion vectors is clipped to the range [mv_(0y), mv_(0y)+H′−1]. In one example if block aspect ratio is k (W=kH), H′ is calculated by solving the equation

k(H′)²+(k+1)H′+1−TWH=0

and performing the following steps: H′=Floor(H′), W′=kH′.

An Example of Using Embodiment 2 in MPEG-5/EVC

In this example, the EIF sub-block size is equal to 4×4. dX[0] corresponds to dHorX, dX[1] corresponds to dHorY, dY[0] corresponds to dVerX and dY[1] corresponds to dVerY.

The variables dX[0], dX[1], dY[0], dY[1] are in 1/512 precision.

. . .

The variable eifSubblockSize is set equal to 4.

The variable eifCanBeApplied is derived as follows:

-   -   eifCanBeApplied is set to TRUE     -   The arrays X[i], Y[i] are derived as follows:     -   X[0]=0     -   X[1]=(eifSubblockSize+1)*(dX[0]+(1<<9))     -   X[2]=(eifSubblockSize+1)*dY[0]     -   X[3]=X[1]+X[2]     -   Y[0]=0     -   Y[1]=(eifSubblockSize+1)*dX[1]     -   Y[2]=(eifSubblockSize+1)*(dY[1]+(1<<9))     -   Y[3]=Y[1]+Y[2]     -   The variable Xmax is set equal to maximum of X[i] for i is equal         0 . . . 3     -   The variable Xmin is set equal to minimum of X[i] for i is equal         0 . . . 3     -   The variable Ymax is set equal to maximum of Y[i] for i is equal         0 . . . 3     -   The variable Ymin is set equal to minimum of Y[i] for i is equal         0 . . . 3     -   The variable W is set equal to (Xmax−Xmin+(1<<9)−1)>>9     -   The variable H is set equal to (Ymax−Ymin+(1<<9)−1)>>9     -   If (W+2)*(H+2) is greater than 81, the variable eifCanBeApplied         is equal to FALSE     -   . . .     -   If eifCanBeApplied is equal to FALSE than the variables sizeSbX         and sizeSbY are modified as follows:     -   sizeSbX=max(8, sizeSbX)     -   sizeSbY=max(8, sizeSbY)

FIG. 12 illustrates a method for coding a video implemented by a coding device, i.e. an encoder or a decoder, according to the present disclosure. The method illustrated in FIG. 12 is a method for coding a video implemented in an encoder or a decoder including the enhanced interpolation filter, EIF, for motion compensation. The method illustrated in FIG. 12 comprises:

-   -   i) (1601) determining control point motion vectors, CPMVs, for a         block according to affine inter-prediction, the block being an         affine block or a sub-block of the affine block;     -   ii) (1603) for a predefined sub-block size determining a         reference area for a sub-block with the predefined sub-block         size according to values of the CPMVs;     -   iii) (1605) comparing the determined reference area with a         predefined threshold;     -   iv) (1609) applying EIF for motion compensation, comprising         deriving the pixel-based motion vector field for the block;     -   wherein (1607) if the determined reference area is larger than         the threshold, deriving the pixel-based motion vector field for         the block further comprises motion vector clipping,     -   wherein motion vector clipping range is determined based on         motion model of the block and the size of the block.

FIG. 13 illustrates a decoder 30 for decoding a video sequence according to an embodiment of the present disclosure. The decoder, including the enhanced interpolation filter, EIF, for motion compensation. The decoder 30 comprising:

-   -   a first determining unit 3001 configured to determine control         point motion vectors, CPMVs, for a block according to affine         inter-prediction, the block being an affine block or a sub-block         of the affine block;     -   a second determining unit 3003 configured to determine for a         predefined sub-block size a reference area for a sub-block with         the predefined sub-block size according to values of the CPMVs;         -   a comparing unit 3005 configured to compare the determined             reference area with a predefined threshold;         -   a motion compensation unit 3007 configured to apply EIF for             motion compensation, comprising deriving the pixel-based             motion vector field for the block;     -   wherein if the determined reference area is larger than the         threshold, the motion compensation unit 3007 is configured to         derive the pixel-based motion vector field for the block further         comprises motion vector clipping,     -   wherein motion vector clipping range is determined based on         motion model of the block and the size of the block.

FIG. 14 illustrates an encoder 20 for encoding a video sequence according to an embodiment of the present disclosure. The encoder, including the enhanced interpolation filter, EIF, for motion compensation. The encoder 30 comprising:

-   -   a first determining unit 2001 configured to determine control         point motion vectors, CPMVs, for a block according to affine         inter-prediction, the block being an affine block or a sub-block         of the affine block;     -   a second determining unit 2003 configured to determine for a         predefined sub-block size a reference area for a sub-block with         the predefined sub-block size according to values of the CPMVs;         -   a comparing unit 2005 configured to compare the determined             reference area with a predefined threshold;         -   a motion compensation unit 2007 configured to apply EIF for             motion compensation, comprising deriving the pixel-based             motion vector field for the block;     -   wherein if the determined reference area is larger than the         threshold, the motion compensation unit 2007 is configured to         derive the pixel-based motion vector field for the block further         comprises motion vector clipping,     -   wherein motion vector clipping range is determined based on         motion model of the block and the size of the block.

The following provides an explanation of the applications of the encoding method as well as the decoding method as shown in the above-mentioned embodiments, and a system using them.

FIG. 10 is a block diagram showing a content supply system 3100 for realizing content distribution service. This content supply system 3100 includes capture device 3102, terminal device 3106, and optionally includes display 3126. The capture device 3102 communicates with the terminal device 3106 over communication link 3104. The communication link may include the communication channel 13 described above. The communication link 3104 includes but not limited to WIFI, Ethernet, Cable, wireless (3G/4G/5G), USB, or any kind of combination thereof, or the like.

The capture device 3102 generates data, and may encode the data by the encoding method as shown in the above embodiments. Alternatively, the capture device 3102 may distribute the data to a streaming server (not shown in the Figures), and the server encodes the data and transmits the encoded data to the terminal device 3106. The capture device 3102 includes but not limited to camera, smart phone or Pad, computer or laptop, video conference system, PDA, vehicle mounted device, or a combination of any of them, or the like. For example, the capture device 3102 may include the source device 12 as described above. When the data includes video, the video encoder 20 included in the capture device 3102 may actually perform video encoding processing. When the data includes audio (i.e., voice), an audio encoder included in the capture device 3102 may actually perform audio encoding processing. For some practical scenarios, the capture device 3102 distributes the encoded video and audio data by multiplexing them together. For other practical scenarios, for example in the video conference system, the encoded audio data and the encoded video data are not multiplexed. Capture device 3102 distributes the encoded audio data and the encoded video data to the terminal device 3106 separately.

In the content supply system 3100, the terminal device 310 receives and reproduces the encoded data. The terminal device 3106 could be a device with data receiving and recovering capability, such as smart phone or Pad 3108, computer or laptop 3110, network video recorder (NVR)/digital video recorder (DVR) 3112, TV 3114, set top box (STB) 3116, video conference system 3118, video surveillance system 3120, personal digital assistant (PDA) 3122, vehicle mounted device 3124, or a combination of any of them, or the like capable of decoding the above-mentioned encoded data. For example, the terminal device 3106 may include the destination device 14 as described above. When the encoded data includes video, the video decoder 30 included in the terminal device is prioritized to perform video decoding. When the encoded data includes audio, an audio decoder included in the terminal device is prioritized to perform audio decoding processing.

For a terminal device with its display, for example, smart phone or Pad 3108, computer or laptop 3110, network video recorder (NVR)/digital video recorder (DVR) 3112, TV 3114, personal digital assistant (PDA) 3122, or vehicle mounted device 3124, the terminal device can feed the decoded data to its display. For a terminal device equipped with no display, for example, STB 3116, video conference system 3118, or video surveillance system 3120, an external display 3126 is contacted therein to receive and show the decoded data.

When each device in this system performs encoding or decoding, the picture encoding device or the picture decoding device, as shown in the above-mentioned embodiments, can be used.

FIG. 11 is a diagram showing a structure of an example of the terminal device 3106. After the terminal device 3106 receives stream from the capture device 3102, the protocol proceeding unit 3202 analyzes the transmission protocol of the stream. The protocol includes but not limited to Real Time Streaming Protocol (RTSP), Hyper Text Transfer Protocol (HTTP), HTTP Live streaming protocol (HLS), MPEG-DASH, Real-time Transport protocol (RTP), Real Time Messaging Protocol (RTMP), or any kind of combination thereof, or the like.

After the protocol proceeding unit 3202 processes the stream, stream file is generated. The file is outputted to a demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into the encoded audio data and the encoded video data. As described above, for some practical scenarios, for example in the video conference system, the encoded audio data and the encoded video data are not multiplexed. In this situation, the encoded data is transmitted to video decoder 3206 and audio decoder 3208 without through the demultiplexing unit 3204.

Via the demultiplexing processing, video elementary stream (ES), audio ES, and optionally subtitle are generated. The video decoder 3206, which includes the video decoder 30 as explained in the above-mentioned embodiments, decodes the video ES by the decoding method as shown in the above-mentioned embodiments to generate video frame, and feeds this data to the synchronous unit 3212. The audio decoder 3208, decodes the audio ES to generate audio frame, and feeds this data to the synchronous unit 3212. Alternatively, the video frame may store in a buffer (not shown in FIG. Y) before feeding it to the synchronous unit 3212. Similarly, the audio frame may store in a buffer (not shown in FIG. 11) before feeding it to the synchronous unit 3212.

The synchronous unit 3212 synchronizes the video frame and the audio frame, and supplies the video/audio to a video/audio display 3214. For example, the synchronous unit 3212 synchronizes the presentation of the video and audio information. Information may code in the syntax using time stamps concerning the presentation of coded audio and visual data and time stamps concerning the delivery of the data stream itself.

If subtitle is included in the stream, the subtitle decoder 3210 decodes the subtitle, synchronizes it with the video frame and the audio frame, and supplies the video/audio/subtitle to a video/audio/subtitle display 3216.

The present disclosure is not limited to the above-mentioned system, and either the picture encoding device or the picture decoding device in the above-mentioned embodiments can be incorporated into other system, for example, a car system.

Mathematical Operators

The mathematical operators used in this disclosure are similar to those used in the C programming language. However, the results of integer division and arithmetic shift operations are defined more precisely, and additional operations are defined, such as exponentiation and real-valued division. Numbering and counting conventions generally begin from 0, e.g., “the first” is equivalent to the 0-th, “the second” is equivalent to the 1-th, etc.

Arithmetic Operators

The following arithmetic operators are defined as follows:

-   -   + Addition     -   − Subtraction (as a two-argument operator) or negation (as a         unary prefix operator)     -   * Multiplication, including matrix multiplication     -   x^(y) Exponentiation. Specifies x to the power of y. In other         contexts, such notation is used for superscripting not intended         for interpretation as exponentiation.     -   / Integer division with truncation of the result toward zero.         For example, 7/4 and −7/−4 are truncated to 1 and −7/4 and 7/−4         are truncated to −1.     -   ÷ Used to denote division in mathematical equations where no         truncation or rounding is intended.

$\frac{x}{y}$

Used to denote division in mathematical equations where no truncation or rounding is intended.

$\sum\limits_{i = x}^{y}\;{f(i)}$

The summation of f(i) with i taking all integer values from x up to and including y.

-   -   x % y Modulus. Remainder of x divided by y, defined only for         integers x and y with x>=0 and y>0.

Logical Operators

The following logical operators are defined as follows:

-   -   x && y Boolean logical “and” of x and y     -   x∥y Boolean logical “or” of x and y     -   ! Boolean logical “not”     -   x ? y: z If x is TRUE or not equal to 0, evaluates to the value         of y; otherwise, evaluates to the value of z.

Relational Operators

The following relational operators are defined as follows:

-   -   > Greater than     -   >= Greater than or equal to     -   < Less than     -   <= Less than or equal to     -   == Equal to     -   != Not equal to

When a relational operator is applied to a syntax element or variable that has been assigned the value “na” (not applicable), the value “na” is treated as a distinct value for the syntax element or variable. The value “na” is considered not to be equal to any other value.

Bit-Wise Operators

The following bit-wise operators are defined as follows:

-   -   & Bit-wise “and”. When operating on integer arguments, operates         on a two's complement representation of the integer value. When         operating on a binary argument that contains fewer bits than         another argument, the shorter argument is extended by adding         more significant bits equal to 0.     -   | Bit-wise “or”. When operating on integer arguments, operates         on a two's complement representation of the integer value. When         operating on a binary argument that contains fewer bits than         another argument, the shorter argument is extended by adding         more significant bits equal to 0.     -   {circumflex over ( )} Bit-wise “exclusive or”. When operating on         integer arguments, operates on a two's complement representation         of the integer value. When operating on a binary argument that         contains fewer bits than another argument, the shorter argument         is extended by adding more significant bits equal to 0.     -   x>>y Arithmetic right shift of a two's complement integer         representation of x by y binary digits. This function is defined         only for non-negative integer values of y. Bits shifted into the         most significant bits (MSBs) as a result of the right shift have         a value equal to the MSB of x prior to the shift operation.     -   x<<y Arithmetic left shift of a two's complement integer         representation of x by y binary digits. This function is defined         only for non-negative integer values of y. Bits shifted into the         least significant bits (LSBs) as a result of the left shift have         a value equal to 0.

Assignment Operators

The following arithmetic operators are defined as follows:

-   -   = Assignment operator     -   ++ Increment, i.e., x++ is equivalent to x=x+1; when used in an         array index, evaluates to the value of the variable prior to the         increment operation.     -   −− Decrement, i.e., x−− is equivalent to x=x−1; when used in an         array index, evaluates to the value of the variable prior to the         decrement operation.     -   += Increment by amount specified, i.e., x+=3 is equivalent to         x=x+3, and x+=(−3) is equivalent to x=x+(−3).     -   Decrement by amount specified, i.e., x−=3 is equivalent to         x=x−3, and x−=(−3) is equivalent to x=x−(−3).

Range Notation

The following notation is used to specify a range of values:

-   -   x=y . . . z x takes on integer values starting from y to z,         inclusive, with x, y, and z being integer numbers and z being         greater than y.

Mathematical Functions

The following mathematical functions are defined:

${{Abs}(x)} = \left\{ \begin{matrix} x & ; & {x>=0} \\ {- x} & ; & {x < 0} \end{matrix} \right.$

-   -   Asin(x) the trigonometric inverse sine function, operating on an         argument x that is in the range of −1.0 to 1.0, inclusive, with         an output value in the range of −π÷2 to π÷2, inclusive, in units         of radians     -   Atan(x) the trigonometric inverse tangent function, operating on         an argument x, with an output value in the range of −π÷2 to π÷2,         inclusive, in units of radians

${{Atan}\; 2\left( {y,x} \right)} = \left\{ \begin{matrix} {{Atan}\left( \frac{y}{x} \right)} & ; & {x > 0} \\ {{{Atan}\left( \frac{y}{x} \right)} + \pi} & ; & {{x < 0}\;\&\&\mspace{11mu}{y>=0}} \\ {{{Atan}\left( \frac{y}{x} \right)} - \pi} & ; & {{x < 0}\;\&\&\mspace{11mu}{y < 0}} \\ {+ \frac{\pi}{2}} & ; & {{x==0}\;\&\&\mspace{11mu}{y>=0}} \\ {- \frac{\pi}{2}} & ; & {otherwise} \end{matrix} \right.$

-   -   Ceil(x) the smallest integer greater than or equal to x.     -   Clip1_(Y)(x)=Clip3(0, (1<<BitDepth_(Y)) −1, x)     -   Clip1_(C)(x)=Clip3(0, (1<<BitDepth_(C))−1, x)

${{Clip}\; 3\left( {x,y,z} \right)} = \left\{ \begin{matrix} x & ; & {z < x} \\ y & ; & {z > y} \\ z & ; & {otherwise} \end{matrix} \right.$

-   -   Cos(x) the trigonometric cosine function operating on an         argument x in units of radians.     -   Floor(x) the largest integer less than or equal to x.

${{GetCurrMsb}\left( {a,b,c,d} \right)} = \left\{ \begin{matrix} {c + d} & ; & {{b - a}>={d\text{/}2}} \\ {c - d} & ; & {{a - b} > {d\text{/}2}} \\ c & ; & {otherwise} \end{matrix} \right.$

-   -   Ln(x) the natural logarithm of x (the base-e logarithm, where e         is the natural logarithm base constant 2.718 281 828 . . . ).     -   Log 2(x) the base-2 logarithm of x.     -   Log 10(x) the base-10 logarithm of x.

${{Min}\left( {x,y} \right)} = \left\{ {{\begin{matrix} x & ; & {x<=y} \\ y & ; & {x > y} \end{matrix}{{Max}\left( {x,y} \right)}} = \left\{ \begin{matrix} x & ; & {x>=y} \\ y & ; & {x < y} \end{matrix} \right.} \right.$

-   -   Round(x)=Sign(x)*Floor(Abs(x)+0.5)

${{Sign}(x)} = \left\{ \begin{matrix} 1 & ; & {x > 0} \\ 0 & ; & {x==0} \\ {- 1} & ; & {x < 0} \end{matrix} \right.$

-   -   Sin(x) the trigonometric sine function operating on an argument         x in units of radians     -   Sqrt(x)=√{square root over (x)}     -   Swap(x, y)=(y, x)     -   Tan(x) the trigonometric tangent function operating on an         argument x in units of radians

Order of Operation Precedence

When an order of precedence in an expression is not indicated explicitly by use of parentheses, the following rules apply:

-   -   Operations of a higher precedence are evaluated before any         operation of a lower precedence.     -   Operations of the same precedence are evaluated sequentially         from left to right.

The table below specifies the precedence of operations from highest to lowest; a higher position in the table indicates a higher precedence.

For those operators that are also used in the C programming language, the order of precedence used in this Specification is the same as used in the C programming language.

TABLE Operation precedence from highest (at top of table) to lowest (at bottom of table) operations (with operands x, y, and z) ″x++″, ″x−−″ ″!x″, ″−x″ (as a unary prefix operator) x^(y) ${{\,^{''}x}*y^{''}},{{\,^{''}x}\text{/}y^{''}},{{\,^{''}x} \div y^{''}},^{''}{{\,\frac{x}{y}}\,^{''}},{{\,^{''}x}\mspace{14mu}\%\mspace{14mu} y^{''}}$ ${{\,^{''}x} + y^{''}},{{\,^{''}x} - {y^{''}\mspace{14mu}\left( \text{as~~a~~two-argument~~operator} \right)}},{\,^{''}{\sum\limits_{i = x}^{y}\;{f(i)}^{''}}}$ ″x << y″, ″x >> y″ ″x < y″, ″x <= y″, ″x > y″, ″x >= y″ ″x == y″, ″x != y″ ″x & y″ ″x|y″ ″x && y″ ″x||y″ ″x ? y : z″ ″x . . . z″ ″x = y″, ″x += y″, ″x −= y″

Text Description of Logical Operations

In the text, a statement of logical operations as would be described mathematically in the following form:

-   -   if(condition 0)         -   statement 0     -   else if(condition 1)         -   statement 1     -   . . .     -   else /* informative remark on remaining condition */         -   statement n             may be described in the following manner:     -   . . . as follows / . . . the following applies:         -   If condition 0, statement 0         -   Otherwise, if condition 1, statement 1         -   Otherwise (informative remark on remaining condition),             statement n

Each “If . . . Otherwise, if . . . Otherwise, . . . ” statement in the text is introduced with “ . . . as follows” or “ . . . the following applies” immediately followed by “If . . . ”. The last condition of the “If . . . Otherwise, if . . . Otherwise, . . . ” is always an “Otherwise, . . . ”. Interleaved “If . . . Otherwise, if . . . Otherwise, . . . ” statements can be identified by matching “ . . . as follows” or “ . . . the following applies” with the ending “Otherwise, . . . ”.

In the text, a statement of logical operations as would be described mathematically in the following form:

-   -   if(condition 0a && condition 0b)         -   statement 0     -   else if(condition 1a∥condition 1b)         -   statement 1     -   . . .     -   else         -   statement n     -   may be described in the following manner:     -   . . . as follows / . . . the following applies:         -   If all of the following conditions are true, statement 0:             -   condition 0a             -   condition 0b         -   Otherwise, if one or more of the following conditions are             true, statement 1:             -   condition 1a             -   condition 1b         -   . . .             -   Otherwise, statement n

In the text, a statement of logical operations as would be described mathematically in the following form:

-   -   if(condition 0)         -   statement 0     -   if(condition 1)         -   statement 1             may be described in the following manner:     -   When condition 0, statement 0     -   When condition 1, statement 1.

Although embodiments have been primarily described based on video coding, it should be noted that embodiments of the coding system 10, encoder 20 and decoder 30 (and correspondingly the system 10) and the other embodiments described herein may also be configured for still picture processing or coding, i.e. the processing or coding of an individual picture independent of any preceding or consecutive picture as in video coding. In general only inter-prediction units 244 (encoder) and 344 (decoder) may not be available in case the picture processing coding is limited to a single picture 17. All other functionalities (also referred to as tools or technologies) of the video encoder 20 and video decoder 30 may equally be used for still picture processing, e.g. residual calculation 204/304, transform 206, quantization 208, inverse quantization 210/310, (inverse) transform 212/312, partitioning 262/362, intra-prediction 254/354, and/or loop filtering 220, 320, and entropy coding 270 and entropy decoding 304.

Embodiments, e.g. of the encoder 20 and the decoder 30, and functions described herein, e.g. with reference to the encoder 20 and the decoder 30, may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over communication media as one or more instructions or code and executed by a hardware-based processing unit.

Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media, which is non-transitory, or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.

By way of example, and not limiting, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. In addition, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term “processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. In addition, the techniques could be fully implemented in one or more circuits or logic elements.

The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware. 

1. A method for coding a video implemented in an encoder or a decoder including an enhanced interpolation filter (EIF) for motion compensation, the method comprising: determining control point motion vectors (CPMVs) for a block according to affine inter-prediction, the block being an affine block or a sub-block of the affine block; determining a reference area for a sub-block of the block, the sub-block of the block having a predefined sub-block size according to values of the CPMVs; comparing the determined reference area with a predefined threshold; applying the EIF for motion compensation, comprising deriving a pixel-based motion vector field for the block; wherein if the determined reference area is larger than the predefined threshold, deriving the pixel-based motion vector field for the block further comprises motion vector clipping, wherein a motion vector clipping range for the motion vector clipping is determined based on a motion model of the block and a size of the block.
 2. The method according to claim 1, wherein applying the EIF for motion compensation further comprises: obtaining interpolated samples in a reference picture based on the derived motion vector field using a T taps interpolation filter, where T is a number of interpolation filter taps corresponding to the filter length, and T is larger than zero; and applying a high-pass filter to the interpolated samples
 3. The method of claim 1, applying EIF for motion compensation further comprises: determining a size of the block; and comparing the size of the block with a first threshold for the size of the block; wherein block-based affine transform prediction is performed on the block when the size of the block is greater than or equal to the first threshold for the size of the block.
 4. The method of claim 3, wherein the size of the block is determined based on affine motion model parameters.
 5. The method of claim 4, wherein the affine motion model parameters include motion vector differences of the CPMVs as well as a width and a height of the block.
 6. The method of claim 4, wherein the affine motion model parameters further include a precision of the CPMVs.
 7. The method of claim 1, wherein the predefined sub-block size for the enhanced interpolation filter is equal to 4×4; wherein dX[0] corresponds to dHorX, dX[1] corresponds to dHorY, dY[0] corresponds to dVerX and dY[1] corresponds to dVerY; wherein determining the reference area for a sub-block with predefined sub-block size according to values of the CPMVs comprises: setting the value of the variable eifSubblockSize equal to 4; deriving the variable eifCanBeApplied as follows: setting the value of eifCanBeApplied to TRUE; deriving the arrays X[i], Y[i] as follows: X[0]=0; X[1]=(eifSubblockSize+1)*(dX[0]+(1<<9)); X[2]=(eifSubblockSize+1)*dY[0]; X[3]=X[1]+X[2]; Y[0]=0; Y[1]=(eifSubblockSize+1)*dX[1]; Y[2]=(eifSubblockSize+1)*(dY[1]+(1<<9)); Y[3]=Y[1]+Y[2]; setting the value of the variable Xmax equal to maximum of X[i] for i being equal to 0 . . . 3 setting the value of the variable Xmin equal to minimum of X[i] for i being equal to 0 . . . 3 setting the value of the variable Ymax equal to maximum of Y[i] for i being equal to 0 . . . 3 setting the value of the variable Ymin equal to minimum of Y[i] for i being equal to 0 . . . 3 setting the value of the variable W equal to the value of (Xmax−Xmin+(1<<9)−1)>>9 setting the value of the variable H equal to the value of (Ymax−Ymin+(1<<9)−1)>>9.
 8. The method of claim 2, wherein T is equal to
 2. 9. The method of claim 1, wherein the predefined threshold is equal to 72 pixels.
 10. The method of claim 1, wherein motion model is affine motion model and motion vector clipping range is determined based on motion model means determined based on CPMVs.
 11. A decoder or encoder, comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, wherein the instructions, when executed by the one or more processors, configure the decoder or encoder to: determine control point motion vectors (CPMVs) for a block according to affine inter-prediction, the block being an affine block or a sub-block of the affine block; determine a reference area for a sub-block of the block, the sub-block of the block having a predefined sub-block size according to values of the CPMVs; compare the determined reference area with a predefined threshold; apply an enhanced interpolation filter (EIF) for motion compensation, comprising deriving a pixel-based motion vector field for the block; wherein if the determined reference area is larger than the predefined threshold, derive the pixel-based motion vector field for the block, further comprises motion vector clip, wherein a motion vector clipping range for the motion vector clipping is determined based on a motion model of the block and a size of the block.
 12. The decoder or encoder of claim 11, wherein the instructions, when executed by the one or more processors, further configure the decoder or encoder to: obtain interpolated samples in a reference picture based on the derived motion vector field using a T taps interpolation filter, where T is a number of interpolation filter taps corresponding to the filter length, and T is larger than zero; and apply a high-pass filter to the interpolated samples
 13. The decoder or encoder of claim 11, wherein the instructions, when executed by the one or more processors, further configure the decoder or encoder to: determine a size of the block; and compare the size of the block with a first threshold for the size of the block; wherein block-based affine transform prediction is performed on the block when the size of the block is greater than or equal to the first threshold for the size of the block.
 14. The decoder or encoder of claim 13, wherein the size of the block is determined based on affine motion model parameters.
 15. The decoder or encoder of claim 14, wherein the affine motion model parameters include motion vector differences of the CPMVs as well as a width and a height of the block.
 16. The decoder or encoder of claim 14, wherein the affine motion model parameters further include a precision of the CPMVs.
 17. The decoder or encoder of claim 11, wherein the predefined sub-block size for the enhanced interpolation filter is equal to 4×4; wherein dX[0] corresponds to dHorX, dX[1] corresponds to dHorY, dY[0] corresponds to dVerX and dY[1] corresponds to dVerY; wherein determining the reference area for a sub-block with predefined sub-block size according to values of the CPMVs comprises: setting the value of the variable eifSubblockSize equal to 4; deriving the variable eifCanBeApplied as follows: setting the value of eifCanBeApplied to TRUE; deriving the arrays X[i], Y[i] as follows: X[0]=0; X[1]=(eifSubblockSize+1)*(dX[0]+(1<<9)); X[2]=(eifSubblockSize+1)*dY[0]; X[3]=X[1]+X[2]; Y[0]=0; Y[1]=(eifSubblockSize+1)*dX[1]; Y[2]=(eifSubblockSize+1)*(dY[1]+(1<<9)); Y[3]=Y[1]+Y[2]; setting the value of the variable Xmax equal to maximum of X[i] for i being equal to 0 . . . 3 setting the value of the variable Xmin equal to minimum of X[i] for i being equal to 0 . . . 3 setting the value of the variable Ymax equal to maximum of Y[i] for i being equal to 0 . . . 3 setting the value of the variable Ymin equal to minimum of Y[i] for i being equal to 0 . . . 3 setting the value of the variable W equal to the value of (Xmax−Xmin+(1<<9)−1)>>9 setting the value of the variable H equal to the value of (Ymax−Ymin+(1<<9)−1)>>9.
 18. The decoder or encoder of claim 12, wherein T is equal to
 2. 19. The decoder or encoder of claim 11, wherein the predefined threshold is equal to 72 pixels.
 20. The decoder or encoder of claim 11, wherein motion model is affine motion model and motion vector clipping range is determined based on motion model means determined based on CPMVs. 